java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:18:35,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:18:35,590 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:18:35,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:18:35,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:18:35,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:18:35,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:18:35,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:18:35,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:18:35,625 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:18:35,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:18:35,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:18:35,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:18:35,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:18:35,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:18:35,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:18:35,637 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:18:35,639 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:18:35,641 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:18:35,643 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:18:35,644 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:18:35,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:18:35,648 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:18:35,648 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:18:35,648 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:18:35,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:18:35,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:18:35,651 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:18:35,652 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:18:35,653 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:18:35,653 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:18:35,654 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:18:35,654 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:18:35,654 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:18:35,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:18:35,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:18:35,656 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-08 14:18:35,669 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:18:35,670 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:18:35,671 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:18:35,671 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:18:35,671 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:18:35,671 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:18:35,671 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:18:35,672 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:18:35,672 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:18:35,672 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-08 14:18:35,672 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-08 14:18:35,672 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:18:35,673 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:18:35,673 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:18:35,674 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:18:35,674 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:18:35,674 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:18:35,674 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:18:35,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:18:35,675 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:18:35,675 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:18:35,675 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:18:35,675 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:18:35,675 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:18:35,676 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:18:35,676 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:18:35,676 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:18:35,676 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:18:35,676 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:18:35,677 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:18:35,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:35,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:18:35,677 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:18:35,677 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:18:35,678 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:18:35,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:18:35,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:18:35,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:18:35,678 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:18:35,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:18:35,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:18:35,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:18:35,729 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:18:35,730 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:18:35,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-01-08 14:18:35,732 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-08 14:18:35,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:18:35,781 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:18:35,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:35,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:18:35,782 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:18:35,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:18:35,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:18:35,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:18:35,830 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:18:35,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,844 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... [2019-01-08 14:18:35,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:18:35,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:18:35,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:18:35,855 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:18:35,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:18:35,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:18:35,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:18:36,228 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:18:36,228 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-08 14:18:36,230 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:36 BoogieIcfgContainer [2019-01-08 14:18:36,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:18:36,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:18:36,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:18:36,234 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:18:36,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:18:35" (1/2) ... [2019-01-08 14:18:36,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e973ae7 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:18:36, skipping insertion in model container [2019-01-08 14:18:36,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:18:36" (2/2) ... [2019-01-08 14:18:36,240 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-08 14:18:36,251 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:18:36,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 14:18:36,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 14:18:36,312 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:18:36,312 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:18:36,312 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:18:36,313 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:18:36,313 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:18:36,313 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:18:36,313 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:18:36,313 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:18:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-08 14:18:36,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 14:18:36,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:36,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 14:18:36,339 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-08 14:18:36,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:36,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:36,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:18:36,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:18:36,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 14:18:36,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:18:36,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:18:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:18:36,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:18:36,524 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-08 14:18:36,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:36,597 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-08 14:18:36,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:18:36,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-08 14:18:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:36,613 INFO L225 Difference]: With dead ends: 12 [2019-01-08 14:18:36,613 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 14:18:36,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:18:36,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 14:18:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-08 14:18:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 14:18:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-08 14:18:36,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-08 14:18:36,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:36,653 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-08 14:18:36,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:18:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-08 14:18:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:18:36,654 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:36,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:18:36,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-08 14:18:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:36,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:36,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:18:36,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:36,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:36,819 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-08 14:18:36,821 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-08 14:18:36,961 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:18:36,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:18:39,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:18:39,696 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 14:18:39,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:39,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:18:39,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:39,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:39,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:39,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:39,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:18:39,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:18:39,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-08 14:18:39,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:39,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:18:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:18:39,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 14:18:39,981 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-08 14:18:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:40,049 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-08 14:18:40,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 14:18:40,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 14:18:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:40,051 INFO L225 Difference]: With dead ends: 13 [2019-01-08 14:18:40,051 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 14:18:40,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 14:18:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 14:18:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 14:18:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 14:18:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-08 14:18:40,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-08 14:18:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:40,057 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-08 14:18:40,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:18:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-08 14:18:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 14:18:40,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:40,060 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-08 14:18:40,060 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:40,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-08 14:18:40,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:40,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:40,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:18:40,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:40,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:40,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:40,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:40,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:40,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:40,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:40,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:40,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 14:18:40,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:40,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:18:40,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-08 14:18:40,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:40,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-08 14:18:40,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:40,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 14:18:40,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 14:18:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:18:40,514 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-08 14:18:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:40,735 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-08 14:18:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:18:40,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-08 14:18:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:40,737 INFO L225 Difference]: With dead ends: 16 [2019-01-08 14:18:40,737 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 14:18:40,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:18:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 14:18:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-08 14:18:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 14:18:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-08 14:18:40,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-08 14:18:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:40,741 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-08 14:18:40,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 14:18:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-08 14:18:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 14:18:40,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:40,742 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-08 14:18:40,742 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-08 14:18:40,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:40,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:40,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 14:18:40,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:40,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:40,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:40,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:40,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:40,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:40,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:40,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:40,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:40,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:40,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 14:18:40,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-08 14:18:41,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:41,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-08 14:18:41,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:41,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 14:18:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 14:18:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:18:41,183 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-08 14:18:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:41,304 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-08 14:18:41,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:18:41,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-08 14:18:41,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:41,306 INFO L225 Difference]: With dead ends: 19 [2019-01-08 14:18:41,306 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 14:18:41,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:18:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 14:18:41,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-08 14:18:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 14:18:41,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-08 14:18:41,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-08 14:18:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:41,310 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-08 14:18:41,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 14:18:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-08 14:18:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-08 14:18:41,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:41,311 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-08 14:18:41,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-08 14:18:41,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:41,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:41,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:41,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:41,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 14:18:41,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:41,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:41,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:41,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:41,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:41,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:41,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:41,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:41,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 14:18:41,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-08 14:18:41,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:41,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-08 14:18:41,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:41,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:18:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:18:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:18:41,615 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-08 14:18:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:41,731 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-08 14:18:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:18:41,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-08 14:18:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:41,733 INFO L225 Difference]: With dead ends: 22 [2019-01-08 14:18:41,733 INFO L226 Difference]: Without dead ends: 15 [2019-01-08 14:18:41,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 14:18:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-08 14:18:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-08 14:18:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-08 14:18:41,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-08 14:18:41,737 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-08 14:18:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:41,737 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-08 14:18:41,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:18:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-08 14:18:41,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-08 14:18:41,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:41,738 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-08 14:18:41,739 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:41,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:41,739 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-08 14:18:41,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:41,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:41,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:41,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 14:18:42,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:42,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:42,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:42,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:42,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:42,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:42,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:42,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:18:42,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:42,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 14:18:42,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-08 14:18:42,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:42,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-08 14:18:42,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:42,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:18:42,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:18:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:18:42,461 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-08 14:18:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:42,515 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-08 14:18:42,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:18:42,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-08 14:18:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:42,517 INFO L225 Difference]: With dead ends: 25 [2019-01-08 14:18:42,518 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 14:18:42,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:18:42,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 14:18:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-08 14:18:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:18:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-08 14:18:42,522 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-08 14:18:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:42,522 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-08 14:18:42,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:18:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-08 14:18:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 14:18:42,523 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:42,523 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-08 14:18:42,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-08 14:18:42,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:42,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:42,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 14:18:42,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:42,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:42,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:42,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:42,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:42,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:42,662 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:42,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:42,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:42,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:42,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 14:18:42,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-08 14:18:43,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:43,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-08 14:18:43,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:43,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 14:18:43,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 14:18:43,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:18:43,205 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-08 14:18:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:43,250 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-08 14:18:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 14:18:43,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-08 14:18:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:43,252 INFO L225 Difference]: With dead ends: 28 [2019-01-08 14:18:43,252 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 14:18:43,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 14:18:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 14:18:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-08 14:18:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 14:18:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-08 14:18:43,256 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-08 14:18:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:43,257 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-08 14:18:43,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 14:18:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-08 14:18:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-08 14:18:43,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:43,258 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-08 14:18:43,258 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:43,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-08 14:18:43,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:43,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:43,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 14:18:43,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:43,414 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:43,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:43,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:43,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:43,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:43,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 14:18:43,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-08 14:18:43,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:43,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-08 14:18:43,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:43,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 14:18:43,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 14:18:43,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:18:43,650 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-08 14:18:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:43,722 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-08 14:18:43,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:18:43,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-08 14:18:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:43,724 INFO L225 Difference]: With dead ends: 31 [2019-01-08 14:18:43,724 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 14:18:43,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:18:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 14:18:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-08 14:18:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 14:18:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-08 14:18:43,728 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-08 14:18:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:43,729 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-08 14:18:43,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 14:18:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-08 14:18:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-08 14:18:43,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:43,729 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-08 14:18:43,730 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:43,730 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-08 14:18:43,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:43,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 14:18:43,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:43,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:43,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:43,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:43,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:43,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:43,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:43,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-08 14:18:43,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:44,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 14:18:44,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-08 14:18:44,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:44,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-08 14:18:44,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:44,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:18:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:18:44,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:18:44,311 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-08 14:18:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:44,518 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-08 14:18:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:18:44,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-08 14:18:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:44,520 INFO L225 Difference]: With dead ends: 34 [2019-01-08 14:18:44,520 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 14:18:44,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:18:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 14:18:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-08 14:18:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 14:18:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-08 14:18:44,526 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-08 14:18:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:44,526 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-08 14:18:44,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:18:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-08 14:18:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-08 14:18:44,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:44,527 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-08 14:18:44,528 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:44,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:44,528 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-08 14:18:44,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:44,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:44,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:44,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:44,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 14:18:44,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:44,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:44,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:44,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:44,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:44,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:44,757 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:44,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:44,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:44,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:44,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 14:18:44,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-08 14:18:45,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:45,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-08 14:18:45,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:45,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 14:18:45,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 14:18:45,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:18:45,134 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-08 14:18:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:45,232 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-08 14:18:45,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:18:45,238 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-08 14:18:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:45,239 INFO L225 Difference]: With dead ends: 37 [2019-01-08 14:18:45,239 INFO L226 Difference]: Without dead ends: 25 [2019-01-08 14:18:45,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:18:45,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-08 14:18:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-08 14:18:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 14:18:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-08 14:18:45,246 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-08 14:18:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:45,246 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-08 14:18:45,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 14:18:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-08 14:18:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-08 14:18:45,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:45,252 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-08 14:18:45,252 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:45,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-08 14:18:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:45,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:45,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 14:18:45,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:45,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:45,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:45,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:45,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:45,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:45,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:45,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:45,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 14:18:45,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-08 14:18:46,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:46,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-08 14:18:46,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:46,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 14:18:46,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 14:18:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:18:46,201 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-08 14:18:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:46,261 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-08 14:18:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 14:18:46,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-08 14:18:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:46,264 INFO L225 Difference]: With dead ends: 40 [2019-01-08 14:18:46,264 INFO L226 Difference]: Without dead ends: 27 [2019-01-08 14:18:46,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 14:18:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-08 14:18:46,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-08 14:18:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-08 14:18:46,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-08 14:18:46,269 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-08 14:18:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:46,269 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-08 14:18:46,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 14:18:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-08 14:18:46,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-08 14:18:46,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:46,270 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-08 14:18:46,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-08 14:18:46,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:46,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:46,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 14:18:46,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:46,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:46,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:46,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:46,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:46,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:46,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:46,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:46,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-08 14:18:46,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:46,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 14:18:46,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-08 14:18:46,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:46,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-08 14:18:46,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:46,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:18:46,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:18:46,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-08 14:18:46,934 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-08 14:18:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:47,024 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-08 14:18:47,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-08 14:18:47,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-08 14:18:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:47,026 INFO L225 Difference]: With dead ends: 43 [2019-01-08 14:18:47,026 INFO L226 Difference]: Without dead ends: 29 [2019-01-08 14:18:47,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-08 14:18:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-08 14:18:47,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-08 14:18:47,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-08 14:18:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-08 14:18:47,031 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-08 14:18:47,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:47,032 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-08 14:18:47,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:18:47,032 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-08 14:18:47,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-08 14:18:47,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:47,033 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-08 14:18:47,033 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:47,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:47,034 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-08 14:18:47,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:47,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:47,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:47,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:47,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 14:18:47,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:47,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:47,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:47,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:47,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:47,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:47,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:47,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:47,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:47,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:47,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 14:18:47,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-08 14:18:47,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:47,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-08 14:18:47,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:47,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-08 14:18:47,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-08 14:18:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 14:18:47,698 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-08 14:18:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:47,795 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-08 14:18:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 14:18:47,796 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-08 14:18:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:47,797 INFO L225 Difference]: With dead ends: 46 [2019-01-08 14:18:47,797 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 14:18:47,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 14:18:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 14:18:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-08 14:18:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:18:47,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-08 14:18:47,803 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-08 14:18:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:47,803 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-08 14:18:47,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-08 14:18:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-08 14:18:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 14:18:47,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:47,804 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-08 14:18:47,805 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-08 14:18:47,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:47,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:47,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:47,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 14:18:48,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:48,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:48,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:48,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:48,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:48,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:48,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:48,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:48,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 14:18:48,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-08 14:18:48,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:48,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-08 14:18:48,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:48,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-08 14:18:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-08 14:18:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 14:18:48,844 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-08 14:18:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:48,915 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-08 14:18:48,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 14:18:48,917 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-08 14:18:48,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:48,917 INFO L225 Difference]: With dead ends: 49 [2019-01-08 14:18:48,917 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 14:18:48,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 14:18:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 14:18:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-08 14:18:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 14:18:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-08 14:18:48,924 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-08 14:18:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:48,925 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-08 14:18:48,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-08 14:18:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-08 14:18:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-08 14:18:48,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:48,926 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-08 14:18:48,926 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:48,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:48,927 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-08 14:18:48,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:48,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:48,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:48,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 14:18:49,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:49,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:49,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:49,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:49,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:49,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:49,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:49,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:49,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-08 14:18:49,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:49,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 14:18:49,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-08 14:18:49,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:49,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-08 14:18:49,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:49,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 14:18:49,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 14:18:49,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 14:18:49,793 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-08 14:18:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:49,880 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-08 14:18:49,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-08 14:18:49,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-08 14:18:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:49,882 INFO L225 Difference]: With dead ends: 52 [2019-01-08 14:18:49,882 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 14:18:49,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 14:18:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 14:18:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-08 14:18:49,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 14:18:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-08 14:18:49,887 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-08 14:18:49,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:49,888 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-08 14:18:49,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 14:18:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-08 14:18:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-08 14:18:49,889 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:49,889 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-08 14:18:49,889 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:49,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:49,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-08 14:18:49,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:49,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:49,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:49,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:49,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 14:18:50,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:50,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:50,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:50,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:50,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:50,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:50,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:50,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:50,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:50,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:50,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 14:18:50,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-08 14:18:50,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-08 14:18:50,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:50,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-08 14:18:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-08 14:18:50,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 14:18:50,675 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-08 14:18:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:50,791 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-08 14:18:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 14:18:50,794 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-08 14:18:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:50,795 INFO L225 Difference]: With dead ends: 55 [2019-01-08 14:18:50,795 INFO L226 Difference]: Without dead ends: 37 [2019-01-08 14:18:50,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 14:18:50,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-08 14:18:50,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-08 14:18:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 14:18:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-08 14:18:50,800 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-08 14:18:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:50,800 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-08 14:18:50,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-08 14:18:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-08 14:18:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-08 14:18:50,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:50,801 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-08 14:18:50,802 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:50,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-08 14:18:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:50,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:50,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 14:18:51,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:51,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:51,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:51,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:51,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:51,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:51,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:51,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:51,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 14:18:51,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-08 14:18:52,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:52,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-08 14:18:52,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:52,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-08 14:18:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-08 14:18:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 14:18:52,719 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-08 14:18:52,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:52,792 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-08 14:18:52,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 14:18:52,793 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-08 14:18:52,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:52,794 INFO L225 Difference]: With dead ends: 58 [2019-01-08 14:18:52,794 INFO L226 Difference]: Without dead ends: 39 [2019-01-08 14:18:52,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 14:18:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-08 14:18:52,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-08 14:18:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 14:18:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-08 14:18:52,800 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-08 14:18:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:52,800 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-08 14:18:52,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-08 14:18:52,800 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-08 14:18:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-08 14:18:52,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:52,801 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-08 14:18:52,802 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:52,802 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-08 14:18:52,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:52,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:52,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:52,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 14:18:53,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:53,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:53,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:53,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:53,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:53,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:53,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:53,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:53,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-08 14:18:53,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:53,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 14:18:53,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-08 14:18:54,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:54,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-08 14:18:54,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:54,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-08 14:18:54,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-08 14:18:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 14:18:54,148 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-08 14:18:54,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:54,235 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-08 14:18:54,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 14:18:54,236 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-08 14:18:54,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:54,236 INFO L225 Difference]: With dead ends: 61 [2019-01-08 14:18:54,236 INFO L226 Difference]: Without dead ends: 41 [2019-01-08 14:18:54,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 14:18:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-08 14:18:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-08 14:18:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 14:18:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-08 14:18:54,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-08 14:18:54,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:54,242 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-08 14:18:54,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-08 14:18:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-08 14:18:54,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-08 14:18:54,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:54,244 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-08 14:18:54,244 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:54,244 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-08 14:18:54,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:54,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:54,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:54,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:54,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 14:18:54,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:54,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:54,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:54,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:54,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:54,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:54,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:18:54,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:18:55,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:18:55,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:55,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:55,046 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 14:18:55,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-08 14:18:55,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:55,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-08 14:18:55,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:55,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-08 14:18:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-08 14:18:55,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 14:18:55,830 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-08 14:18:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:56,018 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-08 14:18:56,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-08 14:18:56,019 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-08 14:18:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:56,019 INFO L225 Difference]: With dead ends: 64 [2019-01-08 14:18:56,019 INFO L226 Difference]: Without dead ends: 43 [2019-01-08 14:18:56,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 14:18:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-08 14:18:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-08 14:18:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-08 14:18:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-08 14:18:56,025 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-08 14:18:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:56,025 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-08 14:18:56,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-08 14:18:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-08 14:18:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-08 14:18:56,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:56,027 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-08 14:18:56,027 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:56,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:56,027 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-08 14:18:56,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:56,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:56,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:56,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:56,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 14:18:57,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:57,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:57,162 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:57,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:57,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:57,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:57,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:57,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:18:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:57,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:57,210 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 14:18:57,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:57,992 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-08 14:18:58,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:58,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-08 14:18:58,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:58,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-08 14:18:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-08 14:18:58,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 14:18:58,014 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-08 14:18:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:58,091 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-08 14:18:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 14:18:58,092 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-08 14:18:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:58,093 INFO L225 Difference]: With dead ends: 67 [2019-01-08 14:18:58,093 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 14:18:58,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 14:18:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 14:18:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-08 14:18:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 14:18:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-08 14:18:58,100 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-08 14:18:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:58,100 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-08 14:18:58,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-08 14:18:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-08 14:18:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-08 14:18:58,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:58,101 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-08 14:18:58,102 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:58,102 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-08 14:18:58,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:58,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:18:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:58,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:18:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 14:18:58,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:58,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:18:58,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:18:58,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:18:58,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:18:58,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:18:58,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:18:58,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:18:58,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-08 14:18:58,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:18:58,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:18:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 14:18:58,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:18:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-08 14:18:59,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:18:59,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-08 14:18:59,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:18:59,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 14:18:59,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 14:18:59,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 14:18:59,472 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-08 14:18:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:18:59,550 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-08 14:18:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-08 14:18:59,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-08 14:18:59,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:18:59,552 INFO L225 Difference]: With dead ends: 70 [2019-01-08 14:18:59,552 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 14:18:59,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 14:18:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 14:18:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-08 14:18:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 14:18:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-08 14:18:59,558 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-08 14:18:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:18:59,558 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-08 14:18:59,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 14:18:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-08 14:18:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-08 14:18:59,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:18:59,559 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-08 14:18:59,560 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:18:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:18:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-08 14:18:59,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:18:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:59,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:18:59,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:18:59,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:18:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 14:19:00,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:00,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:00,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:00,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:00,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:00,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:00,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:00,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:00,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:00,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:00,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 14:19:00,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-08 14:19:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:00,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-08 14:19:00,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:00,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 14:19:00,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 14:19:00,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 14:19:00,999 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-08 14:19:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:01,091 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-08 14:19:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 14:19:01,094 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-08 14:19:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:01,095 INFO L225 Difference]: With dead ends: 73 [2019-01-08 14:19:01,095 INFO L226 Difference]: Without dead ends: 49 [2019-01-08 14:19:01,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 14:19:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-08 14:19:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-08 14:19:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 14:19:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-08 14:19:01,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-08 14:19:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:01,099 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-08 14:19:01,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 14:19:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-08 14:19:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 14:19:01,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:01,101 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-08 14:19:01,101 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-08 14:19:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:01,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:01,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:01,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:01,657 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 14:19:01,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:01,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:01,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:01,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:01,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:01,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:01,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:01,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:01,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 14:19:01,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-08 14:19:02,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:02,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-08 14:19:02,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:02,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-08 14:19:02,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-08 14:19:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 14:19:02,700 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-08 14:19:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:02,830 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-08 14:19:02,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-08 14:19:02,832 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-08 14:19:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:02,833 INFO L225 Difference]: With dead ends: 76 [2019-01-08 14:19:02,833 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 14:19:02,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 14:19:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 14:19:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-08 14:19:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 14:19:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-08 14:19:02,842 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-08 14:19:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:02,842 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-08 14:19:02,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-08 14:19:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-08 14:19:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-08 14:19:02,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:02,843 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-08 14:19:02,843 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:02,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-08 14:19:02,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:02,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:02,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:02,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 14:19:03,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:03,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:03,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:03,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:03,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:03,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:03,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:03,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-08 14:19:03,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:03,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 14:19:03,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-08 14:19:04,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:04,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-08 14:19:04,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:04,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 14:19:04,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 14:19:04,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:19:04,447 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-08 14:19:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:04,539 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-08 14:19:04,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 14:19:04,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-08 14:19:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:04,540 INFO L225 Difference]: With dead ends: 79 [2019-01-08 14:19:04,540 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 14:19:04,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:19:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 14:19:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-08 14:19:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 14:19:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-08 14:19:04,546 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-08 14:19:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:04,546 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-08 14:19:04,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 14:19:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-08 14:19:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-08 14:19:04,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:04,547 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-08 14:19:04,547 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-08 14:19:04,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:04,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:04,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:04,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:04,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 14:19:05,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:05,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:05,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:05,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:05,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:05,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:05,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:05,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:05,286 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:05,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:05,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 14:19:05,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-08 14:19:07,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:07,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-08 14:19:07,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:07,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-08 14:19:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-08 14:19:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 14:19:07,044 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-08 14:19:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:07,165 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-08 14:19:07,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 14:19:07,166 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-08 14:19:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:07,166 INFO L225 Difference]: With dead ends: 82 [2019-01-08 14:19:07,166 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 14:19:07,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 14:19:07,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 14:19:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-08 14:19:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 14:19:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-08 14:19:07,170 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-08 14:19:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:07,171 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-08 14:19:07,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-08 14:19:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-08 14:19:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-08 14:19:07,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:07,172 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-08 14:19:07,172 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:07,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-08 14:19:07,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:07,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:07,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:07,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:07,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 14:19:08,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:08,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:08,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:08,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:08,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:08,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:08,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:08,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:08,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 14:19:08,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-08 14:19:09,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:09,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-08 14:19:09,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:09,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-08 14:19:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-08 14:19:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 14:19:09,441 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-08 14:19:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:09,537 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-08 14:19:09,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-08 14:19:09,538 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-08 14:19:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:09,538 INFO L225 Difference]: With dead ends: 85 [2019-01-08 14:19:09,538 INFO L226 Difference]: Without dead ends: 57 [2019-01-08 14:19:09,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 14:19:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-08 14:19:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-08 14:19:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-08 14:19:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-08 14:19:09,543 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-08 14:19:09,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:09,543 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-08 14:19:09,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-08 14:19:09,543 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-08 14:19:09,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-08 14:19:09,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:09,544 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-08 14:19:09,544 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:09,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:09,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-08 14:19:09,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:09,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:09,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:09,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:09,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 14:19:10,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:10,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:10,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:10,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:10,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:10,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:10,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:10,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:10,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-08 14:19:10,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:10,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 14:19:10,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-08 14:19:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:12,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-08 14:19:12,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:12,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 14:19:12,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 14:19:12,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 14:19:12,010 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-08 14:19:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:12,115 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-08 14:19:12,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-08 14:19:12,115 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-08 14:19:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:12,116 INFO L225 Difference]: With dead ends: 88 [2019-01-08 14:19:12,116 INFO L226 Difference]: Without dead ends: 59 [2019-01-08 14:19:12,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 14:19:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-08 14:19:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-08 14:19:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 14:19:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-08 14:19:12,121 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-08 14:19:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:12,122 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-08 14:19:12,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 14:19:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-08 14:19:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-08 14:19:12,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:12,122 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-08 14:19:12,123 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:12,123 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-08 14:19:12,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:12,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:12,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:12,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 14:19:12,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:12,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:12,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:12,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:12,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:12,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:12,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:12,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:12,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:12,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:12,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:13,008 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 14:19:13,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-08 14:19:14,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:14,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-08 14:19:14,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:14,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-08 14:19:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-08 14:19:14,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 14:19:14,562 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-08 14:19:14,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:14,693 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-08 14:19:14,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 14:19:14,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-08 14:19:14,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:14,695 INFO L225 Difference]: With dead ends: 91 [2019-01-08 14:19:14,695 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 14:19:14,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 14:19:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 14:19:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-08 14:19:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 14:19:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-08 14:19:14,700 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-08 14:19:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:14,700 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-08 14:19:14,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-08 14:19:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-08 14:19:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-08 14:19:14,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:14,701 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-08 14:19:14,701 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:14,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-08 14:19:14,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:14,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:14,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:14,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:14,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 14:19:15,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:15,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:15,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:15,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:15,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:15,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:15,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:15,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:15,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:15,560 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 14:19:15,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:17,521 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-08 14:19:17,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:17,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-08 14:19:17,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:17,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-08 14:19:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-08 14:19:17,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 14:19:17,541 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-08 14:19:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:17,689 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-08 14:19:17,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 14:19:17,690 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-08 14:19:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:17,691 INFO L225 Difference]: With dead ends: 94 [2019-01-08 14:19:17,691 INFO L226 Difference]: Without dead ends: 63 [2019-01-08 14:19:17,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 14:19:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-08 14:19:17,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-08 14:19:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 14:19:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-08 14:19:17,695 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-08 14:19:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:17,696 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-08 14:19:17,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-08 14:19:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-08 14:19:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-08 14:19:17,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:17,697 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-08 14:19:17,697 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-08 14:19:17,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:17,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:17,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 14:19:18,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:18,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:18,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:18,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:18,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:18,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:18,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:18,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:18,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-08 14:19:18,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:18,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 14:19:18,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-08 14:19:20,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:20,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-08 14:19:20,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:20,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 14:19:20,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 14:19:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 14:19:20,220 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-08 14:19:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:20,331 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-08 14:19:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 14:19:20,332 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-08 14:19:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:20,332 INFO L225 Difference]: With dead ends: 97 [2019-01-08 14:19:20,333 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 14:19:20,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 14:19:20,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 14:19:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-08 14:19:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-08 14:19:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-08 14:19:20,336 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-08 14:19:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:20,337 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-08 14:19:20,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 14:19:20,337 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-08 14:19:20,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-08 14:19:20,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:20,337 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-08 14:19:20,337 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:20,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:20,338 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-08 14:19:20,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:20,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:20,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:20,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:20,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 14:19:21,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:21,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:21,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:21,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:21,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:21,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:21,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:21,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:21,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:21,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:21,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 14:19:21,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-08 14:19:23,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:23,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-08 14:19:23,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:23,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-08 14:19:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-08 14:19:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 14:19:23,171 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-08 14:19:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:23,333 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-08 14:19:23,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-08 14:19:23,334 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-08 14:19:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:23,335 INFO L225 Difference]: With dead ends: 100 [2019-01-08 14:19:23,335 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 14:19:23,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 14:19:23,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 14:19:23,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-08 14:19:23,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 14:19:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-08 14:19:23,339 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-08 14:19:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:23,340 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-08 14:19:23,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-08 14:19:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-08 14:19:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-08 14:19:23,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:23,340 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-08 14:19:23,341 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:23,341 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-08 14:19:23,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:23,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:23,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:23,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 14:19:24,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:24,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:24,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:24,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:24,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:24,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:24,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:24,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:24,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 14:19:24,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-08 14:19:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:26,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-08 14:19:26,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-08 14:19:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-08 14:19:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 14:19:26,011 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-08 14:19:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:26,157 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-08 14:19:26,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 14:19:26,158 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-08 14:19:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:26,159 INFO L225 Difference]: With dead ends: 103 [2019-01-08 14:19:26,159 INFO L226 Difference]: Without dead ends: 69 [2019-01-08 14:19:26,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 14:19:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-08 14:19:26,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-08 14:19:26,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-08 14:19:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-08 14:19:26,163 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-08 14:19:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:26,163 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-08 14:19:26,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-08 14:19:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-08 14:19:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-08 14:19:26,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:26,164 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-08 14:19:26,164 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:26,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-08 14:19:26,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:26,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:26,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:26,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:26,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 14:19:27,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:27,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:27,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:27,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:27,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:27,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:27,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:27,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:27,335 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-08 14:19:27,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:27,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 14:19:27,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-08 14:19:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-08 14:19:29,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-08 14:19:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-08 14:19:29,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 14:19:29,392 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-08 14:19:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:29,556 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-08 14:19:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 14:19:29,556 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-08 14:19:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:29,557 INFO L225 Difference]: With dead ends: 106 [2019-01-08 14:19:29,557 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 14:19:29,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 14:19:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 14:19:29,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-08 14:19:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 14:19:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-08 14:19:29,562 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-08 14:19:29,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:29,562 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-08 14:19:29,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-08 14:19:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-08 14:19:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-08 14:19:29,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:29,563 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-08 14:19:29,563 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:29,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-08 14:19:29,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:29,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:29,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:29,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 14:19:30,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:30,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:30,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:30,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:30,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:30,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:30,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:30,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:30,397 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:30,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:30,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 14:19:30,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:32,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-08 14:19:32,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:32,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-08 14:19:32,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:32,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-08 14:19:32,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-08 14:19:32,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 14:19:32,787 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-08 14:19:32,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:32,988 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-08 14:19:32,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 14:19:32,988 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-08 14:19:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:32,989 INFO L225 Difference]: With dead ends: 109 [2019-01-08 14:19:32,989 INFO L226 Difference]: Without dead ends: 73 [2019-01-08 14:19:32,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 14:19:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-08 14:19:32,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-08 14:19:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 14:19:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-08 14:19:32,992 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-08 14:19:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:32,993 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-08 14:19:32,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-08 14:19:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-08 14:19:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 14:19:32,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:32,993 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-08 14:19:32,994 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:32,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-08 14:19:32,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:32,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:32,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:32,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 14:19:34,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:34,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:34,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:34,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:34,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:34,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:34,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:34,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 14:19:34,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-08 14:19:37,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:37,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-08 14:19:37,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:37,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-08 14:19:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-08 14:19:37,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 14:19:37,239 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-08 14:19:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:37,440 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-08 14:19:37,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 14:19:37,441 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-08 14:19:37,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:37,441 INFO L225 Difference]: With dead ends: 112 [2019-01-08 14:19:37,441 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 14:19:37,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 14:19:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 14:19:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-08 14:19:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 14:19:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-08 14:19:37,445 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-08 14:19:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:37,445 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-08 14:19:37,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-08 14:19:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-08 14:19:37,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-08 14:19:37,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:37,446 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-08 14:19:37,446 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-08 14:19:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:37,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 14:19:38,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:38,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:38,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:38,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:38,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:38,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:38,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:38,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:39,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-08 14:19:39,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:39,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 14:19:39,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-08 14:19:41,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-08 14:19:41,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:41,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 14:19:41,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 14:19:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 14:19:41,693 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-08 14:19:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:41,839 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-08 14:19:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-08 14:19:41,840 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-08 14:19:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:41,840 INFO L225 Difference]: With dead ends: 115 [2019-01-08 14:19:41,840 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 14:19:41,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 14:19:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 14:19:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-08 14:19:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 14:19:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-08 14:19:41,843 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-08 14:19:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:41,843 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-08 14:19:41,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 14:19:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-08 14:19:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-08 14:19:41,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:41,844 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-08 14:19:41,844 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:41,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-08 14:19:41,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:41,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:41,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:41,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 14:19:43,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:43,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:43,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:43,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:43,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:43,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:43,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:43,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:43,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:43,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:43,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 14:19:43,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-08 14:19:45,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:45,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-08 14:19:45,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:45,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-08 14:19:45,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-08 14:19:45,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 14:19:45,630 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-08 14:19:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:45,790 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-08 14:19:45,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 14:19:45,790 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-08 14:19:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:45,791 INFO L225 Difference]: With dead ends: 118 [2019-01-08 14:19:45,791 INFO L226 Difference]: Without dead ends: 79 [2019-01-08 14:19:45,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 14:19:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-08 14:19:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-08 14:19:45,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-08 14:19:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-08 14:19:45,794 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-08 14:19:45,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:45,794 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-08 14:19:45,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-08 14:19:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-08 14:19:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-08 14:19:45,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:45,795 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-08 14:19:45,795 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-08 14:19:45,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:45,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:45,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:45,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 14:19:46,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:46,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:46,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:46,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:46,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:46,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:46,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:46,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:46,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 14:19:46,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-08 14:19:49,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:49,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-08 14:19:49,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:49,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-08 14:19:49,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-08 14:19:49,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 14:19:49,667 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-08 14:19:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:49,828 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-08 14:19:49,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 14:19:49,828 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-08 14:19:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:49,829 INFO L225 Difference]: With dead ends: 121 [2019-01-08 14:19:49,829 INFO L226 Difference]: Without dead ends: 81 [2019-01-08 14:19:49,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 14:19:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-08 14:19:49,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-08 14:19:49,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-08 14:19:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-08 14:19:49,832 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-08 14:19:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:49,833 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-08 14:19:49,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-08 14:19:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-08 14:19:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-08 14:19:49,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:49,834 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-08 14:19:49,834 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:49,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-08 14:19:49,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:49,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:49,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:49,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:49,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 14:19:50,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:50,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:50,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:50,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:50,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:50,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:50,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:50,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:51,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-08 14:19:51,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:51,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:51,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 14:19:51,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-08 14:19:54,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:54,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-08 14:19:54,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:54,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-08 14:19:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-08 14:19:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 14:19:54,572 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-08 14:19:54,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:54,731 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-08 14:19:54,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-08 14:19:54,731 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-08 14:19:54,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:54,732 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:19:54,732 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 14:19:54,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 14:19:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 14:19:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-08 14:19:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-08 14:19:54,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-08 14:19:54,736 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-08 14:19:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:54,736 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-08 14:19:54,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-08 14:19:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-08 14:19:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-08 14:19:54,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:54,737 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-08 14:19:54,737 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:54,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-08 14:19:54,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:54,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:54,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:54,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 14:19:55,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:55,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:55,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:55,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:55,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:55,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:55,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:55,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:55,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:55,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:55,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 14:19:55,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-08 14:19:59,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:59,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-08 14:19:59,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:59,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-08 14:19:59,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-08 14:19:59,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 14:19:59,117 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-08 14:19:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:59,287 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-08 14:19:59,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-08 14:19:59,288 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-08 14:19:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:59,288 INFO L225 Difference]: With dead ends: 127 [2019-01-08 14:19:59,289 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 14:19:59,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 14:19:59,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 14:19:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-08 14:19:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-08 14:19:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-08 14:19:59,293 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-08 14:19:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:59,293 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-08 14:19:59,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-08 14:19:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-08 14:19:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-08 14:19:59,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:59,294 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-08 14:19:59,294 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:59,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-08 14:19:59,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:59,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:59,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 14:20:00,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:00,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:00,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:00,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:00,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:00,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:00,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:00,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:01,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 14:20:01,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-08 14:20:04,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:04,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-08 14:20:04,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:04,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-08 14:20:04,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-08 14:20:04,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 14:20:04,394 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-08 14:20:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:04,597 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-08 14:20:04,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-08 14:20:04,597 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-08 14:20:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:04,598 INFO L225 Difference]: With dead ends: 130 [2019-01-08 14:20:04,598 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 14:20:04,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 14:20:04,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 14:20:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-08 14:20:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 14:20:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-08 14:20:04,602 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-08 14:20:04,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:04,602 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-08 14:20:04,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-08 14:20:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-08 14:20:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 14:20:04,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:04,603 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-08 14:20:04,604 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:04,604 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-08 14:20:04,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:04,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 14:20:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:06,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:06,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:06,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:06,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:06,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:06,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:06,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:06,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-08 14:20:06,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:06,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 14:20:06,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:09,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-08 14:20:09,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:09,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-08 14:20:09,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:09,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 14:20:09,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 14:20:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 14:20:09,961 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-08 14:20:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:10,155 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-08 14:20:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 14:20:10,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-08 14:20:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:10,156 INFO L225 Difference]: With dead ends: 133 [2019-01-08 14:20:10,156 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 14:20:10,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 14:20:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 14:20:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-08 14:20:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-08 14:20:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-08 14:20:10,160 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-08 14:20:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:10,160 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-08 14:20:10,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 14:20:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-08 14:20:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-08 14:20:10,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:10,161 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-08 14:20:10,161 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:10,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:10,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-08 14:20:10,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:10,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:10,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:10,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 14:20:12,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:12,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:12,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:12,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:12,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:12,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:12,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:12,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:12,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:12,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:12,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 14:20:12,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:16,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-08 14:20:16,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:16,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-08 14:20:16,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:16,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-08 14:20:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-08 14:20:16,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 14:20:16,325 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-08 14:20:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:16,508 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-08 14:20:16,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-08 14:20:16,508 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-08 14:20:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:16,509 INFO L225 Difference]: With dead ends: 136 [2019-01-08 14:20:16,509 INFO L226 Difference]: Without dead ends: 91 [2019-01-08 14:20:16,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 14:20:16,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-08 14:20:16,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-08 14:20:16,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-08 14:20:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-08 14:20:16,512 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-08 14:20:16,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:16,513 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-08 14:20:16,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-08 14:20:16,513 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-08 14:20:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-08 14:20:16,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:16,514 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-08 14:20:16,514 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:16,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:16,514 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-08 14:20:16,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:16,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:16,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 14:20:18,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:18,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:18,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:18,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:18,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:18,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:18,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:18,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:18,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 14:20:18,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-08 14:20:22,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:22,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-08 14:20:22,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:22,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-08 14:20:22,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-08 14:20:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 14:20:22,166 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-08 14:20:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:22,482 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-08 14:20:22,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-08 14:20:22,483 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-08 14:20:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:22,483 INFO L225 Difference]: With dead ends: 139 [2019-01-08 14:20:22,483 INFO L226 Difference]: Without dead ends: 93 [2019-01-08 14:20:22,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 14:20:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-08 14:20:22,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-08 14:20:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 14:20:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-08 14:20:22,486 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-08 14:20:22,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:22,487 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-08 14:20:22,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-08 14:20:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-08 14:20:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-08 14:20:22,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:22,487 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-08 14:20:22,487 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-08 14:20:22,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:22,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 14:20:24,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:24,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:24,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:24,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:24,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:24,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:24,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:24,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:24,490 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-08 14:20:24,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:24,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 14:20:24,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:28,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-08 14:20:28,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:28,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-08 14:20:28,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:28,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 14:20:28,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 14:20:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 14:20:28,123 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-08 14:20:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:29,985 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-08 14:20:29,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 14:20:29,985 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-08 14:20:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:29,986 INFO L225 Difference]: With dead ends: 142 [2019-01-08 14:20:29,986 INFO L226 Difference]: Without dead ends: 95 [2019-01-08 14:20:29,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 14:20:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-08 14:20:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-08 14:20:29,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 14:20:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-08 14:20:29,990 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-08 14:20:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:29,990 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-08 14:20:29,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 14:20:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-08 14:20:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-08 14:20:29,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:29,991 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-08 14:20:29,991 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:29,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:29,992 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-08 14:20:29,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:29,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:29,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:29,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:29,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 14:20:31,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:31,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:31,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:31,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:31,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:31,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:31,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:31,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:31,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:31,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:31,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 14:20:31,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-08 14:20:36,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:36,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-08 14:20:36,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:36,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-08 14:20:36,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-08 14:20:36,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 14:20:36,239 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-08 14:20:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:36,509 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-08 14:20:36,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 14:20:36,511 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-08 14:20:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:36,512 INFO L225 Difference]: With dead ends: 145 [2019-01-08 14:20:36,512 INFO L226 Difference]: Without dead ends: 97 [2019-01-08 14:20:36,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 14:20:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-08 14:20:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-08 14:20:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 14:20:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-08 14:20:36,515 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-08 14:20:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:36,515 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-08 14:20:36,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-08 14:20:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-08 14:20:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-08 14:20:36,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:36,516 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-08 14:20:36,516 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-08 14:20:36,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:36,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:36,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 14:20:39,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:39,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:39,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:39,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:39,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:39,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:39,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:39,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:39,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 14:20:39,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-08 14:20:43,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:43,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-08 14:20:43,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:43,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-08 14:20:43,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-08 14:20:43,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 14:20:43,324 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-08 14:20:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:43,799 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-08 14:20:43,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-08 14:20:43,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-08 14:20:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:43,800 INFO L225 Difference]: With dead ends: 148 [2019-01-08 14:20:43,800 INFO L226 Difference]: Without dead ends: 99 [2019-01-08 14:20:43,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 14:20:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-08 14:20:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-08 14:20:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-08 14:20:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-08 14:20:43,804 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-08 14:20:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:43,804 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-08 14:20:43,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-08 14:20:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-08 14:20:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-08 14:20:43,804 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:43,804 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-08 14:20:43,805 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:43,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:43,805 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-08 14:20:43,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:43,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:43,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:43,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 14:20:45,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:45,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:45,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:45,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:45,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:45,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:45,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:45,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:46,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-08 14:20:46,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:46,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 14:20:46,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-08 14:20:50,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:50,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-08 14:20:50,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:50,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 14:20:50,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 14:20:50,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 14:20:50,803 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-08 14:20:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:51,011 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-08 14:20:51,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 14:20:51,012 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-08 14:20:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:51,012 INFO L225 Difference]: With dead ends: 151 [2019-01-08 14:20:51,012 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 14:20:51,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 14:20:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 14:20:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-08 14:20:51,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 14:20:51,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-08 14:20:51,016 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-08 14:20:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:51,016 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-08 14:20:51,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 14:20:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-08 14:20:51,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-08 14:20:51,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:51,017 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-08 14:20:51,018 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:51,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:51,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-08 14:20:51,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:51,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:51,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:51,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 14:20:52,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:52,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:52,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:52,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:52,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:52,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:52,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:52,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:52,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:52,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:52,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 14:20:52,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-08 14:20:57,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:57,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-08 14:20:57,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:57,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-08 14:20:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-08 14:20:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 14:20:57,235 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-08 14:20:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:57,525 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-08 14:20:57,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-08 14:20:57,530 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-08 14:20:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:57,531 INFO L225 Difference]: With dead ends: 154 [2019-01-08 14:20:57,531 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:20:57,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 14:20:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:20:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-08 14:20:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 14:20:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-08 14:20:57,536 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-08 14:20:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:57,536 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-08 14:20:57,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-08 14:20:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-08 14:20:57,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-08 14:20:57,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:57,537 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-08 14:20:57,537 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-08 14:20:57,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:57,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:57,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:57,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:57,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 14:20:59,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:59,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:59,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:59,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:59,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:59,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:59,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:59,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:59,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 14:20:59,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-08 14:21:03,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:03,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-08 14:21:03,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:03,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-08 14:21:03,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-08 14:21:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 14:21:03,987 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-08 14:21:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:04,356 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-08 14:21:04,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 14:21:04,356 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-08 14:21:04,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:04,357 INFO L225 Difference]: With dead ends: 157 [2019-01-08 14:21:04,357 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 14:21:04,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 14:21:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 14:21:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-08 14:21:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-08 14:21:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-08 14:21:04,361 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-08 14:21:04,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:04,361 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-08 14:21:04,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-08 14:21:04,362 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-08 14:21:04,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-08 14:21:04,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:04,362 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-08 14:21:04,363 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:04,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:04,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-08 14:21:04,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:04,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:04,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:04,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 14:21:06,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:06,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:06,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:06,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:06,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:06,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:06,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:21:06,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:21:07,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-08 14:21:07,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:07,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 14:21:07,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-08 14:21:12,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:12,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-08 14:21:12,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:12,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 14:21:12,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 14:21:12,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 14:21:12,315 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-08 14:21:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:13,301 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-08 14:21:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-08 14:21:13,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-08 14:21:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:13,302 INFO L225 Difference]: With dead ends: 160 [2019-01-08 14:21:13,302 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 14:21:13,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 14:21:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 14:21:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-08 14:21:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-08 14:21:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-08 14:21:13,306 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-08 14:21:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:13,307 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-08 14:21:13,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 14:21:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-08 14:21:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-08 14:21:13,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:13,308 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-08 14:21:13,308 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-08 14:21:13,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:13,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:13,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:13,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 14:21:15,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:15,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:15,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:15,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:15,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:15,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:15,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:21:15,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:21:15,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:21:15,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:15,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 14:21:15,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-08 14:21:20,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:20,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-08 14:21:20,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:20,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-08 14:21:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-08 14:21:20,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 14:21:20,686 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-08 14:21:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:20,958 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-08 14:21:20,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 14:21:20,959 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-08 14:21:20,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:20,959 INFO L225 Difference]: With dead ends: 163 [2019-01-08 14:21:20,959 INFO L226 Difference]: Without dead ends: 109 [2019-01-08 14:21:20,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 14:21:20,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-08 14:21:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-08 14:21:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-08 14:21:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-08 14:21:20,963 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-08 14:21:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:20,964 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-08 14:21:20,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-08 14:21:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-08 14:21:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-08 14:21:20,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:20,964 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-08 14:21:20,965 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-08 14:21:20,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:20,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:20,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:20,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 14:21:22,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:22,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:22,747 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:22,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:22,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:22,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:22,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:21:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:22,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 14:21:22,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-08 14:21:28,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:28,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-08 14:21:28,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:28,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-08 14:21:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-08 14:21:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 14:21:28,072 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-08 14:21:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:28,340 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-08 14:21:28,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 14:21:28,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-08 14:21:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:28,342 INFO L225 Difference]: With dead ends: 166 [2019-01-08 14:21:28,342 INFO L226 Difference]: Without dead ends: 111 [2019-01-08 14:21:28,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 14:21:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-08 14:21:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-08 14:21:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-08 14:21:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-08 14:21:28,346 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-08 14:21:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:28,346 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-08 14:21:28,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-08 14:21:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-08 14:21:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-08 14:21:28,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:28,347 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-08 14:21:28,347 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:28,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:28,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-08 14:21:28,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:28,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:28,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:28,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:28,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-08 14:21:30,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:30,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:30,480 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:30,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:30,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:30,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:21:30,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:21:31,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-08 14:21:31,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:31,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-08 14:21:31,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-08 14:21:37,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:37,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-08 14:21:37,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:37,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-08 14:21:37,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-08 14:21:37,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 14:21:37,198 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-08 14:21:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:37,492 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-08 14:21:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-08 14:21:37,492 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-08 14:21:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:37,493 INFO L225 Difference]: With dead ends: 169 [2019-01-08 14:21:37,493 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 14:21:37,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 14:21:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 14:21:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-08 14:21:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-08 14:21:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-08 14:21:37,497 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-08 14:21:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:37,497 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-08 14:21:37,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-08 14:21:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-08 14:21:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-08 14:21:37,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:37,498 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-08 14:21:37,498 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-08 14:21:37,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:37,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:37,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:37,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:37,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-08 14:21:39,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:39,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:39,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:39,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:39,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:39,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:39,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:21:39,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:21:39,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:21:39,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:39,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-08 14:21:39,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-08 14:21:45,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:45,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-08 14:21:45,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:45,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-08 14:21:45,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-08 14:21:45,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 14:21:45,515 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-08 14:21:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:45,763 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-08 14:21:45,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-08 14:21:45,764 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-08 14:21:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:45,765 INFO L225 Difference]: With dead ends: 172 [2019-01-08 14:21:45,765 INFO L226 Difference]: Without dead ends: 115 [2019-01-08 14:21:45,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 14:21:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-08 14:21:45,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-08 14:21:45,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-08 14:21:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-08 14:21:45,769 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-08 14:21:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:45,769 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-08 14:21:45,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-08 14:21:45,769 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-08 14:21:45,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-08 14:21:45,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:45,770 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-08 14:21:45,770 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:45,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:45,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-08 14:21:45,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:45,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:45,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:45,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:45,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-08 14:21:47,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:47,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:47,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:47,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:47,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:47,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:47,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:47,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:21:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:47,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-08 14:21:47,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-08 14:21:54,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-08 14:21:54,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:54,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-08 14:21:54,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-08 14:21:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 14:21:54,138 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-08 14:21:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:54,545 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-08 14:21:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 14:21:54,545 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-08 14:21:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:54,546 INFO L225 Difference]: With dead ends: 175 [2019-01-08 14:21:54,546 INFO L226 Difference]: Without dead ends: 117 [2019-01-08 14:21:54,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 14:21:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-08 14:21:54,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-08 14:21:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-08 14:21:54,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-08 14:21:54,550 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-08 14:21:54,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:54,551 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-08 14:21:54,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-08 14:21:54,551 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-08 14:21:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-08 14:21:54,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:54,552 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-08 14:21:54,552 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:54,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-08 14:21:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:54,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-08 14:21:56,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:56,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:56,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:56,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:56,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:56,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:56,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:21:56,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:21:57,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-08 14:21:57,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:57,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-08 14:21:57,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-08 14:22:04,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:04,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-08 14:22:04,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:04,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 14:22:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 14:22:04,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 14:22:04,170 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-08 14:22:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:04,546 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-08 14:22:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 14:22:04,547 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-08 14:22:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:04,547 INFO L225 Difference]: With dead ends: 178 [2019-01-08 14:22:04,548 INFO L226 Difference]: Without dead ends: 119 [2019-01-08 14:22:04,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 14:22:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-08 14:22:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-08 14:22:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-08 14:22:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-08 14:22:04,552 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-08 14:22:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:04,552 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-08 14:22:04,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 14:22:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-08 14:22:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-08 14:22:04,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:04,553 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-08 14:22:04,553 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-08 14:22:04,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:04,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:04,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:22:04,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:04,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-08 14:22:06,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:06,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:06,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:06,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:06,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:06,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:06,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:22:06,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:22:06,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:22:06,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:22:06,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-08 14:22:06,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-08 14:22:13,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:13,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-08 14:22:13,285 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:13,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-08 14:22:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-08 14:22:13,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 14:22:13,287 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-08 14:22:13,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:13,620 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-08 14:22:13,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 14:22:13,621 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-08 14:22:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:13,621 INFO L225 Difference]: With dead ends: 181 [2019-01-08 14:22:13,621 INFO L226 Difference]: Without dead ends: 121 [2019-01-08 14:22:13,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 14:22:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-08 14:22:13,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-08 14:22:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-08 14:22:13,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-08 14:22:13,625 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-08 14:22:13,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:13,626 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-08 14:22:13,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-08 14:22:13,626 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-08 14:22:13,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-08 14:22:13,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:13,627 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-08 14:22:13,627 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:13,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-08 14:22:13,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:13,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:22:13,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:13,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-08 14:22:15,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:15,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:15,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:15,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:15,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:15,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:15,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:22:15,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:22:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:15,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-08 14:22:16,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-08 14:22:22,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:22,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-08 14:22:22,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:22,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-08 14:22:22,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-08 14:22:22,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 14:22:22,424 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-08 14:22:22,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:22,827 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-08 14:22:22,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-08 14:22:22,827 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-08 14:22:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:22,828 INFO L225 Difference]: With dead ends: 184 [2019-01-08 14:22:22,828 INFO L226 Difference]: Without dead ends: 123 [2019-01-08 14:22:22,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 14:22:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-08 14:22:22,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-08 14:22:22,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-08 14:22:22,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-08 14:22:22,832 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-08 14:22:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:22,832 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-08 14:22:22,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-08 14:22:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-08 14:22:22,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-08 14:22:22,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:22,834 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-08 14:22:22,834 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:22,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:22,834 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-08 14:22:22,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:22,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:22,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:22:22,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:22,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-08 14:22:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:25,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:25,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:25,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:25,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:25,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:22:25,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:22:26,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-08 14:22:26,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:22:26,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:26,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-08 14:22:26,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-08 14:22:33,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:33,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-08 14:22:33,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:33,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-08 14:22:33,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-08 14:22:33,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 14:22:33,018 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-08 14:22:33,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:33,391 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-08 14:22:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 14:22:33,391 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-08 14:22:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:33,392 INFO L225 Difference]: With dead ends: 187 [2019-01-08 14:22:33,392 INFO L226 Difference]: Without dead ends: 125 [2019-01-08 14:22:33,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 14:22:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-08 14:22:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-08 14:22:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-08 14:22:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-08 14:22:33,396 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-08 14:22:33,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:33,397 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-08 14:22:33,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-08 14:22:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-08 14:22:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-08 14:22:33,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:33,398 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-08 14:22:33,398 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-08 14:22:33,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:33,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:33,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:22:33,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:33,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-08 14:22:35,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:35,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:35,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:35,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:35,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:35,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:35,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:22:35,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:22:35,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:22:35,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:22:35,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-08 14:22:35,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-08 14:22:43,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:43,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-08 14:22:43,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:43,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-08 14:22:43,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-08 14:22:43,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-08 14:22:43,141 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-08 14:22:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:43,450 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-08 14:22:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 14:22:43,451 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-08 14:22:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:43,452 INFO L225 Difference]: With dead ends: 190 [2019-01-08 14:22:43,452 INFO L226 Difference]: Without dead ends: 127 [2019-01-08 14:22:43,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-08 14:22:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-08 14:22:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-08 14:22:43,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-08 14:22:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-08 14:22:43,456 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-08 14:22:43,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:43,456 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-08 14:22:43,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-08 14:22:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-08 14:22:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-08 14:22:43,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:43,457 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-08 14:22:43,457 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-08 14:22:43,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:43,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:22:43,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:43,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-08 14:22:45,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:45,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:45,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:45,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:45,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:45,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:45,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:22:45,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:22:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:45,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-08 14:22:45,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-08 14:22:53,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:53,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-08 14:22:53,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:53,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-08 14:22:53,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-08 14:22:53,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 14:22:53,449 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-08 14:22:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:53,881 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-08 14:22:53,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 14:22:53,881 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-08 14:22:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:53,882 INFO L225 Difference]: With dead ends: 193 [2019-01-08 14:22:53,882 INFO L226 Difference]: Without dead ends: 129 [2019-01-08 14:22:53,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 14:22:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-08 14:22:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-08 14:22:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-08 14:22:53,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-08 14:22:53,885 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-08 14:22:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:53,885 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-08 14:22:53,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-08 14:22:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-08 14:22:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-08 14:22:53,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:53,886 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-08 14:22:53,886 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-08 14:22:53,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:22:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:53,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-08 14:22:56,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:56,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:56,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:56,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:56,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:56,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:56,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:22:56,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:22:57,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-08 14:22:57,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:22:57,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:57,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-08 14:22:57,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-08 14:23:04,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:04,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-08 14:23:04,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:04,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 14:23:04,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 14:23:04,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 14:23:04,789 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-08 14:23:05,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:05,235 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-08 14:23:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-08 14:23:05,235 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-08 14:23:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:05,236 INFO L225 Difference]: With dead ends: 196 [2019-01-08 14:23:05,236 INFO L226 Difference]: Without dead ends: 131 [2019-01-08 14:23:05,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 14:23:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-08 14:23:05,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-08 14:23:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-08 14:23:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-08 14:23:05,239 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-08 14:23:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:05,240 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-08 14:23:05,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 14:23:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-08 14:23:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-08 14:23:05,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:05,240 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-08 14:23:05,241 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:05,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-08 14:23:05,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:05,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:05,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:23:05,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:05,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-08 14:23:07,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:07,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:07,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:07,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:07,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:07,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:07,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:23:07,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:23:08,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:23:08,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:23:08,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-08 14:23:08,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-08 14:23:15,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:15,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-08 14:23:15,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:15,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-08 14:23:15,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-08 14:23:15,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 14:23:15,580 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-08 14:23:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:16,041 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-08 14:23:16,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-08 14:23:16,041 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-08 14:23:16,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:16,042 INFO L225 Difference]: With dead ends: 199 [2019-01-08 14:23:16,042 INFO L226 Difference]: Without dead ends: 133 [2019-01-08 14:23:16,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 14:23:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-08 14:23:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-08 14:23:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-08 14:23:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-08 14:23:16,047 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-08 14:23:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:16,047 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-08 14:23:16,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-08 14:23:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-08 14:23:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-08 14:23:16,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:16,048 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-08 14:23:16,048 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-08 14:23:16,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:16,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:23:16,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:16,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-08 14:23:18,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:18,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:18,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:18,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:18,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:18,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:18,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:23:18,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:23:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:19,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-08 14:23:19,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-08 14:23:26,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:26,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-08 14:23:26,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:26,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-08 14:23:26,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-08 14:23:26,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 14:23:26,952 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-08 14:23:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:27,483 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-08 14:23:27,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 14:23:27,483 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-08 14:23:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:27,484 INFO L225 Difference]: With dead ends: 202 [2019-01-08 14:23:27,484 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 14:23:27,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 14:23:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 14:23:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-08 14:23:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-08 14:23:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-08 14:23:27,488 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-08 14:23:27,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:27,489 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-08 14:23:27,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-08 14:23:27,489 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-08 14:23:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-08 14:23:27,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:27,490 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-08 14:23:27,490 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-08 14:23:27,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:27,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:23:27,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:27,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-08 14:23:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:30,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:30,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:30,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:30,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:30,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:30,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:23:30,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:23:34,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-08 14:23:34,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:23:34,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-08 14:23:34,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-08 14:23:43,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:43,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-08 14:23:43,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:43,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-08 14:23:43,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-08 14:23:43,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 14:23:43,619 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-08 14:23:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:44,044 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-08 14:23:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 14:23:44,044 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-08 14:23:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:44,045 INFO L225 Difference]: With dead ends: 205 [2019-01-08 14:23:44,045 INFO L226 Difference]: Without dead ends: 137 [2019-01-08 14:23:44,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 14:23:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-08 14:23:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-08 14:23:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-08 14:23:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-08 14:23:44,049 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-08 14:23:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:44,050 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-08 14:23:44,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-08 14:23:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-08 14:23:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-08 14:23:44,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:44,051 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-08 14:23:44,051 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-08 14:23:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:44,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:23:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:44,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-08 14:23:46,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:46,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:46,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:46,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:46,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:46,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:46,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:23:46,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:23:46,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:23:46,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:23:46,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-08 14:23:46,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-08 14:23:55,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:55,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-08 14:23:55,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:55,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-08 14:23:55,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-08 14:23:55,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 14:23:55,648 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-08 14:23:56,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:56,184 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-08 14:23:56,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-08 14:23:56,184 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-08 14:23:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:56,185 INFO L225 Difference]: With dead ends: 208 [2019-01-08 14:23:56,185 INFO L226 Difference]: Without dead ends: 139 [2019-01-08 14:23:56,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 14:23:56,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-08 14:23:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-08 14:23:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-08 14:23:56,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-08 14:23:56,189 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-08 14:23:56,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:56,189 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-08 14:23:56,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-08 14:23:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-08 14:23:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-08 14:23:56,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:56,191 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-08 14:23:56,191 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-08 14:23:56,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:56,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:23:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:56,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-08 14:23:59,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:59,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:59,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:59,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:59,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:59,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:59,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:23:59,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:23:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:59,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-08 14:23:59,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:24:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-08 14:24:07,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:24:07,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-08 14:24:07,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:24:07,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-08 14:24:07,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-08 14:24:07,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 14:24:07,728 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-08 14:24:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:24:08,259 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-08 14:24:08,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-08 14:24:08,259 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-08 14:24:08,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:24:08,260 INFO L225 Difference]: With dead ends: 211 [2019-01-08 14:24:08,260 INFO L226 Difference]: Without dead ends: 141 [2019-01-08 14:24:08,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 14:24:08,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-08 14:24:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-08 14:24:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-08 14:24:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-08 14:24:08,263 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-08 14:24:08,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:24:08,264 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-08 14:24:08,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-08 14:24:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-08 14:24:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-08 14:24:08,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:24:08,265 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-08 14:24:08,265 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:24:08,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:24:08,265 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-08 14:24:08,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:24:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:08,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:24:08,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:08,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:24:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-08 14:24:11,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:11,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:24:11,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:24:11,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:24:11,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:11,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:24:11,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:24:11,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:24:15,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-08 14:24:15,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:24:15,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:24:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-08 14:24:15,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:24:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-08 14:24:24,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:24:24,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-08 14:24:24,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:24:24,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 14:24:24,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 14:24:24,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 14:24:24,167 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-08 14:24:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:24:24,742 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-08 14:24:24,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-08 14:24:24,743 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-08 14:24:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:24:24,744 INFO L225 Difference]: With dead ends: 214 [2019-01-08 14:24:24,744 INFO L226 Difference]: Without dead ends: 143 [2019-01-08 14:24:24,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 14:24:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-08 14:24:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-08 14:24:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-08 14:24:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-08 14:24:24,747 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-08 14:24:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:24:24,747 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-08 14:24:24,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 14:24:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-08 14:24:24,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-08 14:24:24,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:24:24,748 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-08 14:24:24,748 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:24:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:24:24,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-08 14:24:24,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:24:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:24,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:24:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:24,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:24:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-08 14:24:27,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:27,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:24:27,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:24:27,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:24:27,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:27,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:24:27,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:24:27,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:24:27,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:24:27,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:24:27,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:24:27,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-08 14:24:27,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:24:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-08 14:24:37,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:24:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-08 14:24:37,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:24:37,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-08 14:24:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-08 14:24:37,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 14:24:37,081 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-08 14:24:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:24:37,643 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-08 14:24:37,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 14:24:37,643 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-08 14:24:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:24:37,644 INFO L225 Difference]: With dead ends: 217 [2019-01-08 14:24:37,644 INFO L226 Difference]: Without dead ends: 145 [2019-01-08 14:24:37,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 14:24:37,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-08 14:24:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-08 14:24:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-08 14:24:37,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-08 14:24:37,649 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-08 14:24:37,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:24:37,649 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-08 14:24:37,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-08 14:24:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-08 14:24:37,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-08 14:24:37,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:24:37,650 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-08 14:24:37,650 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:24:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:24:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-08 14:24:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:24:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:37,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:24:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:37,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:24:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-08 14:24:41,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:41,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:24:41,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:24:41,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:24:41,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:41,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:24:41,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:24:41,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:24:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:41,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:24:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-08 14:24:41,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:24:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-08 14:24:50,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:24:50,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-08 14:24:50,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:24:50,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-08 14:24:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-08 14:24:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 14:24:50,637 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-08 14:24:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:24:51,111 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-08 14:24:51,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-08 14:24:51,112 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-08 14:24:51,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:24:51,113 INFO L225 Difference]: With dead ends: 220 [2019-01-08 14:24:51,113 INFO L226 Difference]: Without dead ends: 147 [2019-01-08 14:24:51,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 14:24:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-08 14:24:51,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-08 14:24:51,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-08 14:24:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-08 14:24:51,118 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-08 14:24:51,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:24:51,118 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-08 14:24:51,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-08 14:24:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-08 14:24:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-08 14:24:51,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:24:51,119 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-08 14:24:51,119 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:24:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:24:51,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-08 14:24:51,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:24:51,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:51,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:24:51,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:51,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:24:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-08 14:24:54,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:54,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:24:54,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:24:54,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:24:54,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:54,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:24:54,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:24:54,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:24:57,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-08 14:24:57,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:24:57,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:24:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-08 14:24:57,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-08 14:25:06,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:06,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-08 14:25:06,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:06,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 14:25:06,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 14:25:06,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 14:25:06,989 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-08 14:25:07,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:07,641 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-08 14:25:07,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-08 14:25:07,641 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-08 14:25:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:07,642 INFO L225 Difference]: With dead ends: 223 [2019-01-08 14:25:07,642 INFO L226 Difference]: Without dead ends: 149 [2019-01-08 14:25:07,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 14:25:07,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-08 14:25:07,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-08 14:25:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-08 14:25:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-08 14:25:07,646 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-08 14:25:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:07,646 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-08 14:25:07,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 14:25:07,647 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-08 14:25:07,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-08 14:25:07,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:07,648 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-08 14:25:07,648 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:07,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-08 14:25:07,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:07,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:07,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:25:07,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:07,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:11,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-08 14:25:11,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:11,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:11,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:11,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:11,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:11,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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:11,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:25:11,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:25:11,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:25:11,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:25:11,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-08 14:25:11,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-08 14:25:21,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:21,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-08 14:25:21,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:21,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-08 14:25:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-08 14:25:21,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 14:25:21,076 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-08 14:25:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:21,664 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-08 14:25:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 14:25:21,664 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-08 14:25:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:21,665 INFO L225 Difference]: With dead ends: 226 [2019-01-08 14:25:21,665 INFO L226 Difference]: Without dead ends: 151 [2019-01-08 14:25:21,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 14:25:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-08 14:25:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-08 14:25:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-08 14:25:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-08 14:25:21,669 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-08 14:25:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:21,669 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-08 14:25:21,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-08 14:25:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-08 14:25:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-08 14:25:21,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:21,670 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-08 14:25:21,671 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-08 14:25:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:21,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:25:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:21,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-08 14:25:25,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:25,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:25,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:25,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:25,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:25,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:25,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:25:25,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:25:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:25,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-08 14:25:25,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-08 14:25:35,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:35,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-08 14:25:35,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:35,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-08 14:25:35,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-08 14:25:35,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 14:25:35,309 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-08 14:25:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:35,966 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-08 14:25:35,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 14:25:35,966 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-08 14:25:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:35,967 INFO L225 Difference]: With dead ends: 229 [2019-01-08 14:25:35,967 INFO L226 Difference]: Without dead ends: 153 [2019-01-08 14:25:35,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 14:25:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-08 14:25:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-08 14:25:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-08 14:25:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-08 14:25:35,972 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-08 14:25:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:35,972 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-08 14:25:35,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-08 14:25:35,973 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-08 14:25:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-08 14:25:35,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:35,973 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-08 14:25:35,974 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-08 14:25:35,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:35,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:35,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:25:35,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:35,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-08 14:25:39,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:39,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:39,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:39,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:39,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:39,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:39,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:25:39,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:25:42,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-08 14:25:42,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:25:42,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-08 14:25:42,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-08 14:25:52,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:52,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-08 14:25:52,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:52,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 14:25:52,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 14:25:52,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 14:25:52,597 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-08 14:25:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:53,266 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-08 14:25:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-08 14:25:53,267 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-08 14:25:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:53,267 INFO L225 Difference]: With dead ends: 232 [2019-01-08 14:25:53,267 INFO L226 Difference]: Without dead ends: 155 [2019-01-08 14:25:53,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 14:25:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-08 14:25:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-08 14:25:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-08 14:25:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-08 14:25:53,272 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-08 14:25:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:53,272 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-08 14:25:53,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 14:25:53,272 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-08 14:25:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-08 14:25:53,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:53,273 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-08 14:25:53,273 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:53,273 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-08 14:25:53,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:53,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:25:53,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:53,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-08 14:25:56,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:56,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:56,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:56,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:56,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:56,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:56,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:25:56,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:25:57,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:25:57,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:25:57,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:57,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-08 14:25:57,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:26:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-08 14:26:07,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:26:07,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-08 14:26:07,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:26:07,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-08 14:26:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-08 14:26:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 14:26:07,817 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-08 14:26:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:26:08,587 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-08 14:26:08,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-08 14:26:08,588 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-08 14:26:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:26:08,588 INFO L225 Difference]: With dead ends: 235 [2019-01-08 14:26:08,589 INFO L226 Difference]: Without dead ends: 157 [2019-01-08 14:26:08,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 14:26:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-08 14:26:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-08 14:26:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-08 14:26:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-08 14:26:08,593 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-08 14:26:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:26:08,593 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-08 14:26:08,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-08 14:26:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-08 14:26:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-08 14:26:08,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:26:08,594 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-08 14:26:08,595 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:26:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:26:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-08 14:26:08,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:26:08,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:08,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:26:08,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:08,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:26:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:26:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-08 14:26:12,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:12,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:26:12,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:26:12,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:26:12,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:12,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:26:12,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:26:12,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:26:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:26:12,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:26:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-08 14:26:12,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:26:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-08 14:26:23,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:26:23,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-08 14:26:23,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:26:23,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-08 14:26:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-08 14:26:23,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 14:26:23,534 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-08 14:26:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:26:24,187 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-08 14:26:24,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-08 14:26:24,188 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-08 14:26:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:26:24,188 INFO L225 Difference]: With dead ends: 238 [2019-01-08 14:26:24,188 INFO L226 Difference]: Without dead ends: 159 [2019-01-08 14:26:24,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 14:26:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-08 14:26:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-08 14:26:24,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-08 14:26:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-08 14:26:24,192 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-08 14:26:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:26:24,192 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-08 14:26:24,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-08 14:26:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-08 14:26:24,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-08 14:26:24,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:26:24,193 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-08 14:26:24,194 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:26:24,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:26:24,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-08 14:26:24,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:26:24,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:24,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:26:24,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:24,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:26:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:26:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-08 14:26:28,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:28,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:26:28,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:26:28,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:26:28,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:28,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:26:28,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:26:28,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:26:33,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-08 14:26:33,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:26:33,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:26:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-08 14:26:33,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:26:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-08 14:26:44,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:26:44,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-08 14:26:44,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:26:44,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 14:26:44,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 14:26:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 14:26:44,395 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-08 14:26:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:26:45,200 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-08 14:26:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-08 14:26:45,201 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-08 14:26:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:26:45,202 INFO L225 Difference]: With dead ends: 241 [2019-01-08 14:26:45,202 INFO L226 Difference]: Without dead ends: 161 [2019-01-08 14:26:45,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 14:26:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-08 14:26:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-08 14:26:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-08 14:26:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-08 14:26:45,207 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-08 14:26:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:26:45,207 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-08 14:26:45,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 14:26:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-08 14:26:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-08 14:26:45,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:26:45,208 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-08 14:26:45,208 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:26:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:26:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-08 14:26:45,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:26:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:45,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:26:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:45,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:26:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:26:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-08 14:26:49,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:49,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:26:49,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:26:49,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:26:49,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:49,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:26:49,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:26:49,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:26:49,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:26:49,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:26:49,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:26:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-08 14:26:49,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:27:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-08 14:27:00,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:27:00,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-08 14:27:00,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:27:00,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-08 14:27:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-08 14:27:00,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 14:27:00,865 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-08 14:27:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:27:01,734 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-08 14:27:01,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-08 14:27:01,734 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-08 14:27:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:27:01,735 INFO L225 Difference]: With dead ends: 244 [2019-01-08 14:27:01,735 INFO L226 Difference]: Without dead ends: 163 [2019-01-08 14:27:01,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 14:27:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-08 14:27:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-08 14:27:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-08 14:27:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-08 14:27:01,740 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-08 14:27:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:27:01,740 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-08 14:27:01,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-08 14:27:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-08 14:27:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-08 14:27:01,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:27:01,741 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-08 14:27:01,742 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:27:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:27:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-08 14:27:01,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:27:01,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:01,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:27:01,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:01,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:27:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-08 14:27:05,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:05,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:27:05,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:27:05,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:27:05,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:05,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:27:05,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:27:05,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:27:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:05,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:27:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-08 14:27:05,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:27:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-08 14:27:17,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:27:17,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-08 14:27:17,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:27:17,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-08 14:27:17,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-08 14:27:17,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 14:27:17,817 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-08 14:27:18,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:27:18,792 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-08 14:27:18,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-08 14:27:18,792 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-08 14:27:18,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:27:18,793 INFO L225 Difference]: With dead ends: 247 [2019-01-08 14:27:18,793 INFO L226 Difference]: Without dead ends: 165 [2019-01-08 14:27:18,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 14:27:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-08 14:27:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-08 14:27:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-08 14:27:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-08 14:27:18,797 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-08 14:27:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:27:18,797 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-08 14:27:18,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-08 14:27:18,797 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-08 14:27:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-08 14:27:18,798 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:27:18,798 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-08 14:27:18,798 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:27:18,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:27:18,799 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-08 14:27:18,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:27:18,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:18,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:27:18,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:18,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:27:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-08 14:27:22,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:22,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:27:22,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:27:22,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:27:22,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:22,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:27:22,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:27:22,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:27:26,106 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-08 14:27:26,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:27:26,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:27:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-08 14:27:26,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:27:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-08 14:27:38,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:27:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-08 14:27:38,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:27:38,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-08 14:27:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-08 14:27:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 14:27:38,225 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-08 14:27:39,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:27:39,160 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-08 14:27:39,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 14:27:39,161 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-08 14:27:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:27:39,161 INFO L225 Difference]: With dead ends: 250 [2019-01-08 14:27:39,161 INFO L226 Difference]: Without dead ends: 167 [2019-01-08 14:27:39,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 14:27:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-08 14:27:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-08 14:27:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-08 14:27:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-08 14:27:39,166 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-08 14:27:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:27:39,166 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-08 14:27:39,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-08 14:27:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-08 14:27:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-08 14:27:39,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:27:39,167 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-08 14:27:39,168 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:27:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:27:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-08 14:27:39,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:27:39,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:39,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:27:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:39,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:27:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-08 14:27:43,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:43,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:27:43,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:27:43,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:27:43,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:43,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:27:43,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:27:43,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:27:43,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:27:43,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:27:43,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:27:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-08 14:27:43,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:27:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-08 14:27:56,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:27:56,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-08 14:27:56,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:27:56,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-08 14:27:56,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-08 14:27:56,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 14:27:56,229 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-08 14:27:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:27:56,994 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-08 14:27:56,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-08 14:27:56,994 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-08 14:27:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:27:56,995 INFO L225 Difference]: With dead ends: 253 [2019-01-08 14:27:56,995 INFO L226 Difference]: Without dead ends: 169 [2019-01-08 14:27:56,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 14:27:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-08 14:27:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-08 14:27:56,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-08 14:27:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-08 14:27:56,999 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-08 14:27:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:27:56,999 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-08 14:27:56,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-08 14:27:56,999 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-08 14:27:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-08 14:27:57,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:27:57,000 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-08 14:27:57,000 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:27:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:27:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-08 14:27:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:27:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:57,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:27:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:57,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:27:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:28:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-08 14:28:01,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:01,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:28:01,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:28:01,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:28:01,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:01,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:28:01,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:28:01,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:28:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:28:01,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:28:01,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-08 14:28:01,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:28:14,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-08 14:28:14,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:28:14,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-08 14:28:14,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:28:14,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-08 14:28:14,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-08 14:28:14,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 14:28:14,253 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-08 14:28:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:28:15,256 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-08 14:28:15,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-08 14:28:15,256 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-08 14:28:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:28:15,257 INFO L225 Difference]: With dead ends: 256 [2019-01-08 14:28:15,257 INFO L226 Difference]: Without dead ends: 171 [2019-01-08 14:28:15,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 14:28:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-08 14:28:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-08 14:28:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-08 14:28:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-08 14:28:15,260 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-08 14:28:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:28:15,261 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-08 14:28:15,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-08 14:28:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-08 14:28:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-08 14:28:15,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:28:15,262 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-08 14:28:15,262 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:28:15,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:28:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-08 14:28:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:28:15,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:28:15,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:28:15,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:28:15,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:28:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:28:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-08 14:28:19,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:19,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:28:19,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:28:19,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:28:19,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:19,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:28:19,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:28:19,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:28:30,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-08 14:28:30,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:28:30,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:28:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-08 14:28:30,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:28:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-08 14:28:43,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:28:43,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-08 14:28:43,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:28:43,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 14:28:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 14:28:43,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 14:28:43,166 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-08 14:28:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:28:44,221 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-08 14:28:44,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 14:28:44,221 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-08 14:28:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:28:44,222 INFO L225 Difference]: With dead ends: 259 [2019-01-08 14:28:44,222 INFO L226 Difference]: Without dead ends: 173 [2019-01-08 14:28:44,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 14:28:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-08 14:28:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-08 14:28:44,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-08 14:28:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-08 14:28:44,225 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-08 14:28:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:28:44,226 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-08 14:28:44,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 14:28:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-08 14:28:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-08 14:28:44,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:28:44,227 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-08 14:28:44,227 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:28:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:28:44,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-08 14:28:44,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:28:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:28:44,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:28:44,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:28:44,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:28:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:28:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-08 14:28:48,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:48,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:28:48,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:28:48,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:28:48,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:48,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:28:48,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:28:48,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:28:48,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:28:48,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:28:48,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:28:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-08 14:28:48,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:29:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-08 14:29:02,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:29:02,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-08 14:29:02,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:29:02,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-08 14:29:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-08 14:29:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 14:29:02,381 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-08 14:29:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:29:03,493 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-08 14:29:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-08 14:29:03,493 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-08 14:29:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:29:03,494 INFO L225 Difference]: With dead ends: 262 [2019-01-08 14:29:03,494 INFO L226 Difference]: Without dead ends: 175 [2019-01-08 14:29:03,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 14:29:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-08 14:29:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-08 14:29:03,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-08 14:29:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-08 14:29:03,499 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-08 14:29:03,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:29:03,499 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-08 14:29:03,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-08 14:29:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-08 14:29:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-08 14:29:03,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:29:03,500 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-08 14:29:03,501 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:29:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:29:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-08 14:29:03,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:29:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:03,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:29:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:03,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:29:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:29:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-08 14:29:08,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:08,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:29:08,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:29:08,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:29:08,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:08,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:29:08,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:29:08,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:29:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:29:08,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:29:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-08 14:29:08,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:29:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-08 14:29:22,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:29:22,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-08 14:29:22,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:29:22,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-08 14:29:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-08 14:29:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 14:29:22,096 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-08 14:29:23,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:29:23,207 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-08 14:29:23,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-08 14:29:23,207 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-08 14:29:23,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:29:23,208 INFO L225 Difference]: With dead ends: 265 [2019-01-08 14:29:23,208 INFO L226 Difference]: Without dead ends: 177 [2019-01-08 14:29:23,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 14:29:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-08 14:29:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-08 14:29:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-08 14:29:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-08 14:29:23,212 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-08 14:29:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:29:23,212 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-08 14:29:23,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-08 14:29:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-08 14:29:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-08 14:29:23,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:29:23,214 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-08 14:29:23,214 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:29:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:29:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-08 14:29:23,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:29:23,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:23,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:29:23,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:23,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:29:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:29:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-08 14:29:28,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:28,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:29:28,025 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:29:28,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:29:28,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:28,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:29:28,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:29:28,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:29:38,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-08 14:29:38,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:29:38,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:29:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-08 14:29:38,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:29:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-08 14:29:52,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:29:52,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-08 14:29:52,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:29:52,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 14:29:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 14:29:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 14:29:52,785 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-08 14:29:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:29:53,702 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-08 14:29:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-08 14:29:53,702 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-08 14:29:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:29:53,704 INFO L225 Difference]: With dead ends: 268 [2019-01-08 14:29:53,704 INFO L226 Difference]: Without dead ends: 179 [2019-01-08 14:29:53,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 14:29:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-08 14:29:53,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-08 14:29:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-08 14:29:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-08 14:29:53,708 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-08 14:29:53,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:29:53,708 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-08 14:29:53,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 14:29:53,708 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-08 14:29:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-08 14:29:53,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:29:53,709 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-08 14:29:53,709 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:29:53,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:29:53,709 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-08 14:29:53,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:29:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:53,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:29:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:53,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:29:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:29:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-08 14:29:58,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:58,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:29:58,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:29:58,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:29:58,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:58,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:29:58,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:29:58,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:29:58,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:29:58,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:29:58,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:29:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-08 14:29:58,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:30:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-08 14:30:12,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:30:12,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-08 14:30:12,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:30:12,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-08 14:30:12,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-08 14:30:12,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 14:30:12,932 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-08 14:30:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:30:14,153 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-08 14:30:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-08 14:30:14,153 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-08 14:30:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:30:14,154 INFO L225 Difference]: With dead ends: 271 [2019-01-08 14:30:14,154 INFO L226 Difference]: Without dead ends: 181 [2019-01-08 14:30:14,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 14:30:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-08 14:30:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-08 14:30:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-08 14:30:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-08 14:30:14,158 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-08 14:30:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:30:14,158 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-08 14:30:14,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-08 14:30:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-08 14:30:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-08 14:30:14,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:30:14,159 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-08 14:30:14,159 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:30:14,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:30:14,159 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-08 14:30:14,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:30:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:14,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:30:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:14,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:30:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:30:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-08 14:30:19,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:19,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:30:19,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:30:19,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:30:19,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:19,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:30:19,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:30:19,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:30:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:30:19,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:30:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-08 14:30:19,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:30:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-08 14:30:34,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:30:34,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-08 14:30:34,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:30:34,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-08 14:30:34,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-08 14:30:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 14:30:34,021 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-08 14:30:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:30:34,995 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-08 14:30:34,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-08 14:30:34,996 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-08 14:30:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:30:34,996 INFO L225 Difference]: With dead ends: 274 [2019-01-08 14:30:34,996 INFO L226 Difference]: Without dead ends: 183 [2019-01-08 14:30:34,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 14:30:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-08 14:30:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-08 14:30:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-08 14:30:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-08 14:30:35,000 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-08 14:30:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:30:35,000 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-08 14:30:35,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-08 14:30:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-08 14:30:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-08 14:30:35,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:30:35,001 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-08 14:30:35,001 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:30:35,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:30:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-08 14:30:35,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:30:35,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:35,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:30:35,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:35,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:30:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:30:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-08 14:30:40,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:40,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:30:40,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:30:40,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:30:40,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:40,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:30:40,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:30:40,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:30:45,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-08 14:30:45,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:30:45,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:30:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-08 14:30:45,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:31:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-08 14:31:01,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:31:01,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-08 14:31:01,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:31:01,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 14:31:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 14:31:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 14:31:01,147 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-08 14:31:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:31:02,091 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-08 14:31:02,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-08 14:31:02,091 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-08 14:31:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:31:02,092 INFO L225 Difference]: With dead ends: 277 [2019-01-08 14:31:02,092 INFO L226 Difference]: Without dead ends: 185 [2019-01-08 14:31:02,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 14:31:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-08 14:31:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-08 14:31:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-08 14:31:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-08 14:31:02,096 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-08 14:31:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:31:02,096 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-08 14:31:02,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 14:31:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-08 14:31:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-08 14:31:02,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:31:02,097 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-08 14:31:02,097 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:31:02,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:31:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-08 14:31:02,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:31:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:31:02,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:31:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:31:02,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:31:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:31:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-08 14:31:07,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:31:07,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:31:07,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:31:07,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:31:07,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:31:07,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:31:07,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:31:07,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:31:07,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:31:07,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:31:07,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:31:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-08 14:31:07,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:31:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-08 14:31:23,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:31:23,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-08 14:31:23,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:31:23,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-08 14:31:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-08 14:31:23,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:31:23,100 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-08 14:31:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:31:24,120 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-08 14:31:24,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-08 14:31:24,121 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-08 14:31:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:31:24,122 INFO L225 Difference]: With dead ends: 280 [2019-01-08 14:31:24,122 INFO L226 Difference]: Without dead ends: 187 [2019-01-08 14:31:24,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:31:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-08 14:31:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-08 14:31:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-08 14:31:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-08 14:31:24,127 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-08 14:31:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:31:24,127 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-08 14:31:24,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-08 14:31:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-08 14:31:24,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-08 14:31:24,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:31:24,128 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-08 14:31:24,128 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:31:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:31:24,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-08 14:31:24,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:31:24,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:31:24,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:31:24,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:31:24,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:31:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat