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-a9d37a5-m [2019-02-28 10:37:48,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:37:48,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:37:48,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:37:48,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:37:48,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:37:48,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:37:48,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:37:48,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:37:48,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:37:48,585 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:37:48,585 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:37:48,586 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:37:48,589 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:37:48,590 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:37:48,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:37:48,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:37:48,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:37:48,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:37:48,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:37:48,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:37:48,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:37:48,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:37:48,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:37:48,618 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:37:48,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:37:48,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:37:48,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:37:48,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:37:48,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:37:48,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:37:48,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:37:48,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:37:48,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:37:48,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:37:48,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:37:48,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:37:48,658 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:37:48,658 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:37:48,659 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:37:48,659 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:37:48,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:37:48,663 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:37:48,663 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:37:48,663 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:37:48,663 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:37:48,664 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:37:48,664 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:37:48,664 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:37:48,664 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:37:48,665 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:37:48,665 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:37:48,665 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:37:48,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:37:48,666 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:37:48,666 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:37:48,666 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:37:48,666 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:37:48,666 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:37:48,667 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:37:48,667 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:37:48,667 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:37:48,667 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:37:48,667 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:37:48,672 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:37:48,672 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:37:48,672 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:37:48,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:37:48,673 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:37:48,673 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:37:48,673 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:37:48,673 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:37:48,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:37:48,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:37:48,674 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:37:48,723 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:37:48,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:37:48,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:37:48,738 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:37:48,738 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:37:48,739 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-02-28 10:37:48,739 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-28 10:37:48,772 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:37:48,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:37:48,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:37:48,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:37:48,790 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 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,800 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 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:37:48,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:37:48,809 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:37:48,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... [2019-02-28 10:37:48,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:37:48,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:37:48,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:37:48,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:37:48,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:37:48,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:37:48,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:37:49,111 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:37:49,112 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-28 10:37:49,113 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:49 BoogieIcfgContainer [2019-02-28 10:37:49,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:37:49,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:37:49,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:37:49,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:37:49,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:37:48" (1/2) ... [2019-02-28 10:37:49,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d4bf6d and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:37:49, skipping insertion in model container [2019-02-28 10:37:49,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:37:49" (2/2) ... [2019-02-28 10:37:49,120 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-28 10:37:49,130 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:37:49,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:37:49,153 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:37:49,178 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:37:49,178 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:37:49,179 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:37:49,179 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:37:49,179 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:37:49,179 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:37:49,179 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:37:49,180 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:37:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:37:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:37:49,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:37:49,200 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,206 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-28 10:37:49,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:37:49,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:37:49,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:37:49,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:37:49,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:37:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:37:49,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:37:49,351 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:37:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:49,423 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-28 10:37:49,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:37:49,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:37:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:49,439 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:37:49,439 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:37:49,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:37:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:37:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:37:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:37:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-28 10:37:49,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-28 10:37:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:49,471 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-28 10:37:49,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:37:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-28 10:37:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:37:49,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:49,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:37:49,472 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:49,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:49,473 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-28 10:37:49,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:49,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:49,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:49,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:37:49,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:49,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:49,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-28 10:37:49,619 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-28 10:37:49,702 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:37:49,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:37:52,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:37:52,073 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-02-28 10:37:52,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:52,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:37:52,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:52,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:52,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:52,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:52,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:37:52,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:37:52,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:37:52,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:52,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-28 10:37:52,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:52,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:37:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:37:52,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:37:52,391 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-28 10:37:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:52,535 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-28 10:37:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:37:52,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:37:52,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:52,536 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:37:52,536 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:37:52,537 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-02-28 10:37:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:37:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:37:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:37:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-28 10:37:52,540 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-28 10:37:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:52,540 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-28 10:37:52,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:37:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-28 10:37:52,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:37:52,541 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:52,542 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-28 10:37:52,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:52,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:52,542 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-28 10:37:52,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:52,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:52,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:37:52,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:52,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:52,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:52,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:52,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:52,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:52,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:52,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:37:52,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:52,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:37:52,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:37:52,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-28 10:37:53,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:53,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-28 10:37:53,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:53,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:37:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:37:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:37:53,178 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-28 10:37:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:53,269 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-28 10:37:53,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:37:53,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-28 10:37:53,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:53,270 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:37:53,270 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:37:53,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:37:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:37:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:37:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:37:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-28 10:37:53,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-28 10:37:53,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:53,275 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-28 10:37:53,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:37:53,275 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-28 10:37:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:37:53,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:53,276 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-28 10:37:53,277 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:53,277 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-28 10:37:53,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:53,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:53,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 10:37:53,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:53,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:53,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:53,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:53,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:53,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:53,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:53,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:53,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:53,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:37:53,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 10:37:53,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-28 10:37:53,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:53,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-28 10:37:53,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:53,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:37:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:37:53,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:37:53,890 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-28 10:37:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:53,997 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-28 10:37:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:37:53,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-28 10:37:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:53,999 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:37:53,999 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:37:54,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:37:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:37:54,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:37:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:37:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-28 10:37:54,003 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-28 10:37:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:54,004 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-28 10:37:54,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:37:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-28 10:37:54,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:37:54,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:54,005 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-28 10:37:54,005 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-28 10:37:54,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:54,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,100 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-28 10:37:54,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:54,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:54,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:54,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:54,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:37:54,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-28 10:37:54,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-28 10:37:54,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:54,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-28 10:37:54,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:54,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:37:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:37:54,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:37:54,521 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-28 10:37:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:54,570 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-28 10:37:54,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:37:54,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-28 10:37:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:54,572 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:37:54,572 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:37:54,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:37:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:37:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-28 10:37:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:37:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-28 10:37:54,576 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-28 10:37:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:54,577 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-28 10:37:54,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:37:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-28 10:37:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-28 10:37:54,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:54,578 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-28 10:37:54,578 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:54,578 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-28 10:37:54,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:54,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:54,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:54,768 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 10:37:54,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:54,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:54,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:54,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:54,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:54,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:54,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:54,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:37:54,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:54,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:37:54,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 10:37:54,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-28 10:37:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-28 10:37:55,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:55,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:37:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:37:55,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:37:55,240 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-28 10:37:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:55,286 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-28 10:37:55,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:37:55,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-28 10:37:55,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:55,287 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:37:55,288 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:37:55,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:37:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:37:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:37:55,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:37:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-28 10:37:55,292 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-28 10:37:55,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:55,292 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-28 10:37:55,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:37:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-28 10:37:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:37:55,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:55,293 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-28 10:37:55,293 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-28 10:37:55,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:55,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:55,381 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-28 10:37:55,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:55,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:55,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:55,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:55,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:55,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:55,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:55,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:55,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:37:55,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-28 10:37:55,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:55,624 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-28 10:37:55,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:55,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-28 10:37:55,644 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:55,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:37:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:37:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:37:55,645 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-28 10:37:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:55,695 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-28 10:37:55,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:37:55,695 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-28 10:37:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:55,696 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:37:55,696 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:37:55,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:37:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:37:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:37:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:37:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-28 10:37:55,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-28 10:37:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:55,700 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-28 10:37:55,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:37:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-28 10:37:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 10:37:55,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:55,701 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-28 10:37:55,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:55,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:55,702 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-28 10:37:55,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:55,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:55,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:55,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-28 10:37:55,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:55,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:55,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:55,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:55,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:55,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:55,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:55,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:37:55,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-28 10:37:55,893 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-28 10:37:56,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:56,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-28 10:37:56,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:56,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:37:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:37:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:37:56,124 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-28 10:37:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:56,216 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-28 10:37:56,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:37:56,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-28 10:37:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:56,219 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:37:56,219 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:37:56,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:37:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:37:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:37:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:37:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-28 10:37:56,222 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-28 10:37:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:56,223 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-28 10:37:56,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:37:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-28 10:37:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:37:56,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:56,224 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-28 10:37:56,224 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-28 10:37:56,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:56,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:56,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-28 10:37:56,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:56,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:56,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:56,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:56,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:56,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:56,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:56,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:56,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-28 10:37:56,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:56,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:37:56,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-28 10:37:56,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-28 10:37:56,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:56,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-28 10:37:56,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:56,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:37:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:37:56,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:37:56,625 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-28 10:37:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:56,854 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-28 10:37:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:37:56,854 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-28 10:37:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:56,855 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:37:56,855 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:37:56,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:37:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:37:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-28 10:37:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:37:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-28 10:37:56,861 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-28 10:37:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:56,861 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-28 10:37:56,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:37:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-28 10:37:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 10:37:56,862 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:56,862 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-28 10:37:56,863 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-28 10:37:56,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:56,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:56,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:56,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-28 10:37:57,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:57,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:57,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:57,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:57,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:57,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:57,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:57,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:57,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:57,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:57,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:37:57,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-28 10:37:57,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-28 10:37:57,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:57,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-28 10:37:57,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:57,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:37:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:37:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:37:57,278 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-28 10:37:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:57,331 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-28 10:37:57,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:37:57,332 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-28 10:37:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:57,332 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:37:57,333 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:37:57,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:37:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:37:57,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-28 10:37:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:37:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-28 10:37:57,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-28 10:37:57,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:57,339 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-28 10:37:57,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:37:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-28 10:37:57,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:37:57,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:57,340 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-28 10:37:57,341 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:57,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:57,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-28 10:37:57,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:57,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:57,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:57,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-28 10:37:57,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:57,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:57,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:57,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:57,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:57,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:57,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:57,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:57,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:37:57,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-28 10:37:57,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-28 10:37:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:57,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-28 10:37:57,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:57,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:37:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:37:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:37:57,982 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-28 10:37:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:58,038 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-28 10:37:58,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:37:58,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-28 10:37:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:58,040 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:37:58,041 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:37:58,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:37:58,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:37:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-28 10:37:58,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:37:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-28 10:37:58,046 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-28 10:37:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:58,046 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-28 10:37:58,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:37:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-28 10:37:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:37:58,047 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:58,048 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-28 10:37:58,048 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:58,048 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-28 10:37:58,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:58,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-28 10:37:58,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:58,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:58,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:58,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:58,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:58,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:58,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:37:58,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:37:58,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-28 10:37:58,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:58,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:37:58,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-28 10:37:58,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:58,832 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-28 10:37:58,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:58,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-28 10:37:58,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:58,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:37:58,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:37:58,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:37:58,853 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-28 10:37:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:58,911 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-28 10:37:58,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:37:58,915 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-28 10:37:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:58,916 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:37:58,916 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:37:58,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:37:58,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:37:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-28 10:37:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:37:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-28 10:37:58,923 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-28 10:37:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:58,923 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-28 10:37:58,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:37:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-28 10:37:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:37:58,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:58,925 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-28 10:37:58,925 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:58,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:58,925 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-28 10:37:58,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:58,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:58,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:59,140 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-28 10:37:59,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:59,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:59,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:59,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:59,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:37:59,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:37:59,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:37:59,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:37:59,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:37:59,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-28 10:37:59,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:37:59,514 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-28 10:37:59,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:37:59,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-28 10:37:59,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:37:59,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:37:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:37:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:37:59,537 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-28 10:37:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:37:59,601 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-28 10:37:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:37:59,602 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-28 10:37:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:37:59,603 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:37:59,603 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:37:59,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:37:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:37:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:37:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:37:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-28 10:37:59,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-28 10:37:59,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:37:59,609 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-28 10:37:59,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:37:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-28 10:37:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:37:59,610 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:37:59,610 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-28 10:37:59,610 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:37:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:37:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-28 10:37:59,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:37:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:59,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:37:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:37:59,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:37:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-28 10:37:59,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:37:59,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:37:59,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:37:59,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:37:59,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:37:59,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:37:59,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:37:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:37:59,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:37:59,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:37:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-28 10:37:59,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:00,176 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-28 10:38:00,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:00,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-28 10:38:00,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:00,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:38:00,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:38:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:38:00,197 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-28 10:38:00,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:00,258 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-28 10:38:00,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:38:00,258 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-28 10:38:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:00,259 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:38:00,259 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:38:00,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:38:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:38:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-28 10:38:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:38:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-28 10:38:00,265 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-28 10:38:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:00,266 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-28 10:38:00,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:38:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-28 10:38:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:38:00,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:00,267 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-28 10:38:00,267 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-28 10:38:00,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:00,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:00,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:00,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-28 10:38:00,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:00,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:00,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:00,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:00,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:00,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:00,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:00,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:00,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:38:00,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:00,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:38:00,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:00,491 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-28 10:38:00,491 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-28 10:38:00,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:00,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-28 10:38:00,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:00,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:38:00,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:38:00,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:38:00,987 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-28 10:38:01,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:01,055 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-28 10:38:01,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:38:01,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-28 10:38:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:01,057 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:38:01,057 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:38:01,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:38:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:38:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-28 10:38:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:38:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-28 10:38:01,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-28 10:38:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:01,062 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-28 10:38:01,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:38:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-28 10:38:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:38:01,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:01,063 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-28 10:38:01,063 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-28 10:38:01,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:01,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:01,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-28 10:38:01,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:01,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:01,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:01,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:01,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:01,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:01,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:01,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:01,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:01,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 10:38:01,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-28 10:38:01,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-28 10:38:01,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:01,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-28 10:38:01,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:01,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:38:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:38:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:38:01,696 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-28 10:38:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:01,828 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-28 10:38:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:38:01,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-28 10:38:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:01,830 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:38:01,830 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:38:01,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:38:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:38:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-28 10:38:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:38:01,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-28 10:38:01,836 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-28 10:38:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:01,837 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-28 10:38:01,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:38:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-28 10:38:01,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:38:01,838 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:01,838 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-28 10:38:01,838 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:01,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:01,838 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-28 10:38:01,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:01,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:01,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:01,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-28 10:38:02,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:02,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:02,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:02,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:02,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:02,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:02,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:02,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:02,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:38:02,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:02,425 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-28 10:38:02,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-28 10:38:03,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:03,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-28 10:38:03,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:03,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:38:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:38:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:38:03,174 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-28 10:38:03,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:03,235 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-28 10:38:03,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:38:03,235 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-28 10:38:03,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:03,236 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:38:03,236 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:38:03,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:38:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:38:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-28 10:38:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:38:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-28 10:38:03,242 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-28 10:38:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:03,242 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-28 10:38:03,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:38:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-28 10:38:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-28 10:38:03,243 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:03,243 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-28 10:38:03,243 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:03,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-28 10:38:03,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:03,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:03,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-28 10:38:03,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:03,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:03,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:03,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:03,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:03,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:03,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:03,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-28 10:38:03,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:03,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:38:03,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-28 10:38:03,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-28 10:38:04,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:04,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-28 10:38:04,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:04,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:38:04,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:38:04,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:38:04,265 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-28 10:38:04,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:04,337 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-28 10:38:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:38:04,338 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-28 10:38:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:04,338 INFO L225 Difference]: With dead ends: 61 [2019-02-28 10:38:04,338 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:38:04,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:38:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:38:04,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-28 10:38:04,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:38:04,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-28 10:38:04,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-28 10:38:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:04,344 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-28 10:38:04,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:38:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-28 10:38:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:38:04,345 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:04,345 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-28 10:38:04,345 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-28 10:38:04,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:04,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:04,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:04,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-28 10:38:04,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:04,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:04,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:04,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:04,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:04,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:04,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:04,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:04,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:04,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:38:04,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-28 10:38:04,873 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-28 10:38:05,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:05,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-28 10:38:05,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:05,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:38:05,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:38:05,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:38:05,490 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-28 10:38:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:05,671 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-28 10:38:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:38:05,671 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-28 10:38:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:05,671 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:38:05,672 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:38:05,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:38:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:38:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-28 10:38:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-28 10:38:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-28 10:38:05,677 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-28 10:38:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:05,677 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-28 10:38:05,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:38:05,678 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-28 10:38:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-28 10:38:05,678 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:05,678 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-28 10:38:05,679 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:05,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-28 10:38:05,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:05,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:05,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:05,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-28 10:38:05,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:05,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:05,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:05,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:05,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:05,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:05,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:05,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:06,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 10:38:06,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-28 10:38:06,015 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-28 10:38:06,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:06,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-28 10:38:06,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:06,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:38:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:38:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:38:06,506 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-28 10:38:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:06,578 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-28 10:38:06,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:38:06,578 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-28 10:38:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:06,579 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:38:06,579 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:38:06,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:38:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:38:06,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-28 10:38:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:38:06,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-28 10:38:06,585 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-28 10:38:06,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:06,585 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-28 10:38:06,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:38:06,585 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-28 10:38:06,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:38:06,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:06,586 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-28 10:38:06,586 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:06,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:06,586 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-28 10:38:06,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:06,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:06,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:06,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-28 10:38:07,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:07,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:07,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:07,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:07,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:07,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:07,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:07,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:07,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:38:07,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:07,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:38:07,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-28 10:38:07,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-28 10:38:08,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:08,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-28 10:38:08,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:08,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:38:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:38:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:38:08,417 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-28 10:38:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:08,512 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-28 10:38:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:38:08,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-28 10:38:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:08,513 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:38:08,513 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:38:08,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:38:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:38:08,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-28 10:38:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:38:08,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-28 10:38:08,519 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-28 10:38:08,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:08,519 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-28 10:38:08,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:38:08,519 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-28 10:38:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:38:08,520 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:08,520 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-28 10:38:08,520 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:08,520 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-28 10:38:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:08,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:08,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-28 10:38:09,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:09,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:09,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:09,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:09,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:09,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:09,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:09,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:09,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:09,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:38:09,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-28 10:38:09,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-28 10:38:09,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-28 10:38:09,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:09,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:38:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:38:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:09,799 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-28 10:38:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:09,880 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-28 10:38:09,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:38:09,883 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-28 10:38:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:09,884 INFO L225 Difference]: With dead ends: 73 [2019-02-28 10:38:09,884 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:38:09,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:38:09,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:38:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-28 10:38:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:38:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-28 10:38:09,889 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-28 10:38:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:09,889 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-28 10:38:09,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:38:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-28 10:38:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:38:09,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:09,890 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-28 10:38:09,890 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-28 10:38:09,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:09,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:09,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:09,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-28 10:38:10,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:10,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:10,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:10,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:10,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:10,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:10,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:10,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:10,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-28 10:38:10,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-28 10:38:10,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-28 10:38:11,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:11,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-28 10:38:11,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:11,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:38:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:38:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:38:11,018 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-28 10:38:11,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:11,150 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-28 10:38:11,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:38:11,152 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-28 10:38:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:11,153 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:38:11,153 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:38:11,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:38:11,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:38:11,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-28 10:38:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:38:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-28 10:38:11,158 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-28 10:38:11,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:11,159 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-28 10:38:11,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:38:11,159 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-28 10:38:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:38:11,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:11,160 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-28 10:38:11,163 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:11,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:11,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-28 10:38:11,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:11,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:11,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:11,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:11,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-28 10:38:12,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:12,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:12,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:12,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:12,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:12,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:12,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:12,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:12,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:38:12,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:12,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:38:12,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-28 10:38:12,201 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-28 10:38:12,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:12,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-28 10:38:12,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:12,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:38:12,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:38:12,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:38:12,865 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-28 10:38:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:13,116 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-28 10:38:13,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:38:13,121 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-28 10:38:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:13,122 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:38:13,122 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:38:13,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:38:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:38:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-28 10:38:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:38:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-28 10:38:13,126 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-28 10:38:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:13,126 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-28 10:38:13,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:38:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-28 10:38:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:38:13,127 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:13,127 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-28 10:38:13,127 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:13,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-28 10:38:13,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:13,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:13,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-28 10:38:13,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:13,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:13,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:13,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:13,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:13,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:13,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:13,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:13,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:13,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:38:13,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-28 10:38:13,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-28 10:38:14,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:14,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-28 10:38:14,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:14,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:38:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:38:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:38:14,862 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-28 10:38:14,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:14,976 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-28 10:38:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:38:14,977 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-28 10:38:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:14,977 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:38:14,977 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:38:14,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:38:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:38:14,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-28 10:38:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:38:14,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-28 10:38:14,982 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-28 10:38:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:14,982 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-28 10:38:14,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:38:14,983 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-28 10:38:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-28 10:38:14,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:14,983 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-28 10:38:14,984 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:14,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-28 10:38:14,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:14,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:14,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:14,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-28 10:38:15,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:15,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:15,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:15,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:15,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:15,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:15,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:15,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:15,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:38:15,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-28 10:38:15,559 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-28 10:38:16,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:16,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-28 10:38:16,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:16,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:38:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:38:16,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:38:16,296 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-28 10:38:16,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:16,383 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-28 10:38:16,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:38:16,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-28 10:38:16,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:16,384 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:38:16,384 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:38:16,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:38:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:38:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-28 10:38:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:38:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-28 10:38:16,388 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-28 10:38:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:16,388 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-28 10:38:16,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:38:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-28 10:38:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:38:16,389 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:16,389 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-28 10:38:16,389 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-28 10:38:16,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:16,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:16,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-28 10:38:16,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:16,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:16,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:16,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:16,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:16,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:16,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:16,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:17,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-28 10:38:17,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:17,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:38:17,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-28 10:38:17,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-28 10:38:18,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:18,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-28 10:38:18,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:18,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:38:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:38:18,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:38:18,037 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-28 10:38:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:18,225 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-28 10:38:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:38:18,225 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-28 10:38:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:18,226 INFO L225 Difference]: With dead ends: 88 [2019-02-28 10:38:18,226 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:38:18,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:38:18,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:38:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-28 10:38:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:38:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-28 10:38:18,229 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-28 10:38:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:18,229 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-28 10:38:18,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:38:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-28 10:38:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:38:18,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:18,230 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-28 10:38:18,231 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-28 10:38:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:18,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:18,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:18,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-28 10:38:18,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:18,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:18,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:18,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:18,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:18,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:18,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:18,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:18,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:18,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:18,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:38:18,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-28 10:38:18,723 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-28 10:38:19,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:19,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-28 10:38:19,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:19,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:38:19,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:38:19,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:38:19,595 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-28 10:38:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:19,719 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-28 10:38:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:38:19,720 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-28 10:38:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:19,720 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:38:19,721 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:38:19,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:38:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:38:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-28 10:38:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:38:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-28 10:38:19,725 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-28 10:38:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:19,725 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-28 10:38:19,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:38:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-28 10:38:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:38:19,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:19,726 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-28 10:38:19,726 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:19,726 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-28 10:38:19,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:19,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:19,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:19,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-28 10:38:20,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:20,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:20,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:20,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:20,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:20,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:20,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:20,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:20,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:20,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:38:20,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-28 10:38:20,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-28 10:38:21,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:21,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-28 10:38:21,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:21,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:38:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:38:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:38:21,302 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-28 10:38:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:21,421 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-28 10:38:21,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:38:21,421 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-28 10:38:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:21,422 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:38:21,422 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:38:21,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:38:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:38:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-28 10:38:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:38:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-28 10:38:21,425 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-28 10:38:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:21,426 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-28 10:38:21,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:38:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-28 10:38:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:38:21,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:21,426 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-28 10:38:21,427 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-28 10:38:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:21,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-28 10:38:21,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:21,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:21,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:21,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:21,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:21,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:21,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:21,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:22,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:38:22,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:22,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:38:22,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-28 10:38:22,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-28 10:38:23,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:23,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-28 10:38:23,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:23,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:38:23,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:38:23,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:38:23,059 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-28 10:38:23,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:23,190 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-28 10:38:23,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:38:23,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-28 10:38:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:23,191 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:38:23,191 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:38:23,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:38:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:38:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-28 10:38:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:38:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-28 10:38:23,195 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-28 10:38:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:23,195 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-28 10:38:23,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:38:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-28 10:38:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:38:23,196 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:23,196 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-28 10:38:23,196 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-28 10:38:23,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:23,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:23,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:23,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-28 10:38:23,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:23,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:23,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:23,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:23,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:23,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:23,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:23,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:23,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:23,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-28 10:38:23,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-28 10:38:23,930 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-28 10:38:24,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:24,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-28 10:38:24,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:24,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:38:24,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:38:24,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:38:24,961 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-28 10:38:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:25,112 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-28 10:38:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:38:25,113 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-28 10:38:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:25,114 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:38:25,114 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:38:25,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:38:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:38:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-28 10:38:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:38:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-28 10:38:25,118 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-28 10:38:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:25,118 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-28 10:38:25,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:38:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-28 10:38:25,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:38:25,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:25,119 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-28 10:38:25,119 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:25,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:25,119 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-28 10:38:25,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:25,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:25,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:25,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-28 10:38:25,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:25,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:25,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:25,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:25,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:25,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:25,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:25,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-28 10:38:25,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-28 10:38:25,730 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-28 10:38:26,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:26,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-28 10:38:26,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:26,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:38:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:38:26,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:38:26,873 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-28 10:38:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:27,000 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-28 10:38:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:38:27,001 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-28 10:38:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:27,002 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:38:27,002 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:38:27,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:38:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:38:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-28 10:38:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:38:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-28 10:38:27,005 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-28 10:38:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:27,006 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-28 10:38:27,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:38:27,006 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-28 10:38:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:38:27,006 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:27,006 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-28 10:38:27,007 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-28 10:38:27,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:27,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:27,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-28 10:38:28,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:28,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:28,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:28,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:28,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:28,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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:28,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:28,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:28,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-28 10:38:28,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:28,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:38:28,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-28 10:38:28,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-28 10:38:29,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:29,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-28 10:38:29,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:29,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:38:29,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:38:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:38:29,716 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-28 10:38:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:29,865 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-28 10:38:29,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:38:29,865 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-28 10:38:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:29,866 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:38:29,866 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:38:29,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:38:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:38:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-28 10:38:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:38:29,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-28 10:38:29,870 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-28 10:38:29,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:29,871 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-28 10:38:29,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:38:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-28 10:38:29,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:38:29,872 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:29,872 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-28 10:38:29,872 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:29,872 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-28 10:38:29,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:29,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:29,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:29,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-28 10:38:30,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:30,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:30,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:30,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:30,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:30,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:30,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:30,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:30,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:30,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:30,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:38:30,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-28 10:38:30,525 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:31,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-02-28 10:38:31,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:31,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-28 10:38:31,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:31,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:38:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:38:31,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:31,790 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-28 10:38:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:31,960 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-28 10:38:31,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:38:31,961 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-28 10:38:31,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:31,961 INFO L225 Difference]: With dead ends: 109 [2019-02-28 10:38:31,962 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:38:31,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:38:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:38:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-28 10:38:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:38:31,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-28 10:38:31,964 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-28 10:38:31,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:31,964 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-28 10:38:31,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:38:31,965 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-28 10:38:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:38:31,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:31,965 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-28 10:38:31,965 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-28 10:38:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:31,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:31,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-28 10:38:32,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:32,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:32,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:32,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:32,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:32,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:32,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:32,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-28 10:38:32,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-28 10:38:32,572 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-28 10:38:34,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:34,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-28 10:38:34,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:34,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:38:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:38:34,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:38:34,231 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-28 10:38:34,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:34,406 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-28 10:38:34,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:38:34,406 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-28 10:38:34,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:34,406 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:38:34,407 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:38:34,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:38:34,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:38:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-28 10:38:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:38:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-28 10:38:34,413 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-28 10:38:34,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:34,413 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-28 10:38:34,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:38:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-28 10:38:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-28 10:38:34,414 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:34,414 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-28 10:38:34,414 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:34,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-28 10:38:34,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:34,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:34,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:34,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:34,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-28 10:38:34,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:34,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:34,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:34,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:34,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:34,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:34,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:34,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:35,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-28 10:38:35,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:35,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:38:35,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-28 10:38:35,358 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-28 10:38:36,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:36,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-28 10:38:36,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:36,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:38:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:38:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:38:36,760 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-28 10:38:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:36,917 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-28 10:38:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:38:36,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-28 10:38:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:36,918 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:38:36,918 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:38:36,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:38:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:38:36,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-28 10:38:36,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:38:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-28 10:38:36,921 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-28 10:38:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:36,922 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-28 10:38:36,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:38:36,922 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-28 10:38:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:38:36,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:36,922 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-28 10:38:36,922 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:36,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-28 10:38:36,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:36,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:36,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:36,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:37,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-28 10:38:37,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:37,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:37,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:37,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:37,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:37,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:37,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:37,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:37,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:37,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:37,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:38:37,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-28 10:38:37,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-28 10:38:39,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:39,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-28 10:38:39,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:39,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:38:39,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:38:39,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:38:39,510 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-28 10:38:39,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:39,666 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-28 10:38:39,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:38:39,666 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-28 10:38:39,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:39,667 INFO L225 Difference]: With dead ends: 118 [2019-02-28 10:38:39,667 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:38:39,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:38:39,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:38:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-28 10:38:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:38:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-28 10:38:39,672 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-28 10:38:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:39,672 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-28 10:38:39,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:38:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-28 10:38:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-28 10:38:39,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:39,673 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-28 10:38:39,673 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:39,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:39,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-28 10:38:39,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:39,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:39,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:39,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-28 10:38:40,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:40,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:40,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:40,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:40,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:40,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:40,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:40,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:40,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:38:40,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-28 10:38:40,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-28 10:38:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-28 10:38:41,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:41,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:38:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:38:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:38:41,880 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-28 10:38:42,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:42,030 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-28 10:38:42,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:38:42,030 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-28 10:38:42,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:42,031 INFO L225 Difference]: With dead ends: 121 [2019-02-28 10:38:42,031 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:38:42,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:38:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:38:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-28 10:38:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:38:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-28 10:38:42,035 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-28 10:38:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:42,035 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-28 10:38:42,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:38:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-28 10:38:42,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:38:42,035 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:42,035 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-28 10:38:42,036 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:42,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:42,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-28 10:38:42,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:42,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:42,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:42,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-28 10:38:43,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:43,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:43,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:43,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:43,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:43,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:43,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:43,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:43,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:38:43,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:43,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:38:43,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:43,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-28 10:38:43,464 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-28 10:38:45,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:45,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-28 10:38:45,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:45,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:38:45,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:38:45,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:38:45,745 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-28 10:38:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:45,900 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-28 10:38:45,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:38:45,900 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-28 10:38:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:45,901 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:38:45,901 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:38:45,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:38:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:38:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-28 10:38:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-28 10:38:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-28 10:38:45,904 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-28 10:38:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:45,904 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-28 10:38:45,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:38:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-28 10:38:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-28 10:38:45,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:45,905 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-28 10:38:45,905 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:45,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-28 10:38:45,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:45,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:45,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:45,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:45,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-28 10:38:46,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:46,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:46,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:46,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:46,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:46,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:46,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:46,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:46,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:46,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:46,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-28 10:38:46,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-28 10:38:46,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-28 10:38:48,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:48,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-28 10:38:48,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:48,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:38:48,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:38:48,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:38:48,540 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-28 10:38:48,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:48,695 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-28 10:38:48,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:38:48,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-28 10:38:48,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:48,697 INFO L225 Difference]: With dead ends: 127 [2019-02-28 10:38:48,697 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:38:48,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:38:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:38:48,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-28 10:38:48,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:38:48,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-28 10:38:48,701 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-28 10:38:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:48,701 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-28 10:38:48,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:38:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-28 10:38:48,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:38:48,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:48,702 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-28 10:38:48,702 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:48,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:48,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-28 10:38:48,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:48,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:48,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:48,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:48,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-28 10:38:49,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:49,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:49,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:49,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:49,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:49,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:49,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:49,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:49,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:38:49,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-28 10:38:49,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:51,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-28 10:38:51,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:51,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-28 10:38:51,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:51,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:38:51,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:38:51,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:38:51,654 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-28 10:38:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:51,834 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-28 10:38:51,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:38:51,834 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-28 10:38:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:51,835 INFO L225 Difference]: With dead ends: 130 [2019-02-28 10:38:51,835 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:38:51,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:38:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:38:51,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-28 10:38:51,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:38:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-28 10:38:51,839 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-28 10:38:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:51,839 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-28 10:38:51,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:38:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-28 10:38:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:38:51,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:51,840 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-28 10:38:51,840 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:51,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-28 10:38:51,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:51,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:51,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-28 10:38:52,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:52,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:52,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:52,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:52,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:52,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:52,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:52,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:53,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:38:53,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:53,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:38:53,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-28 10:38:53,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-28 10:38:55,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:55,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-28 10:38:55,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:55,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:38:55,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:38:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:38:55,130 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-28 10:38:55,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:55,325 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-28 10:38:55,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:38:55,325 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-28 10:38:55,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:55,326 INFO L225 Difference]: With dead ends: 133 [2019-02-28 10:38:55,326 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:38:55,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:38:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:38:55,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-28 10:38:55,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:38:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-28 10:38:55,329 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-28 10:38:55,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:55,330 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-28 10:38:55,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:38:55,330 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-28 10:38:55,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:38:55,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:55,330 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-28 10:38:55,330 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:55,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:55,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-28 10:38:55,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:55,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:55,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:55,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:56,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-28 10:38:56,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:56,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:56,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:56,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:56,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:56,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:56,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:56,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:56,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:56,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:56,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:38:56,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-28 10:38:56,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-28 10:38:58,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-28 10:38:58,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:58,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:38:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:38:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:38:58,333 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-28 10:38:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:58,522 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-28 10:38:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:38:58,522 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-28 10:38:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:58,523 INFO L225 Difference]: With dead ends: 136 [2019-02-28 10:38:58,523 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:38:58,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:38:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:38:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-28 10:38:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:38:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-28 10:38:58,527 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-28 10:38:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:58,527 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-28 10:38:58,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:38:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-28 10:38:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:38:58,528 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:58,528 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-28 10:38:58,528 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-28 10:38:58,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:58,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:58,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-28 10:38:59,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:59,932 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:59,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:59,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,932 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:38:59,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:59,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:00,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-28 10:39:00,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:00,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-28 10:39:00,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-28 10:39:02,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:02,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-28 10:39:02,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:02,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:39:02,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:39:02,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:39:02,126 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-28 10:39:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:02,392 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-28 10:39:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:39:02,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-28 10:39:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:02,393 INFO L225 Difference]: With dead ends: 139 [2019-02-28 10:39:02,394 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:39:02,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:39:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:39:02,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-28 10:39:02,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:39:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-28 10:39:02,397 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-28 10:39:02,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:02,397 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-28 10:39:02,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:39:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-28 10:39:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:39:02,397 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:02,397 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-28 10:39:02,398 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:02,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:02,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-28 10:39:02,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:02,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:02,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:02,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:02,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-28 10:39:08,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:08,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:08,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:08,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:08,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:08,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:08,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:08,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:08,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-28 10:39:08,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:08,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:39:08,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-28 10:39:08,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-28 10:39:11,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:11,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-28 10:39:11,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:11,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:39:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:39:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:39:11,058 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-28 10:39:12,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:12,017 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-28 10:39:12,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:39:12,018 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-28 10:39:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:12,018 INFO L225 Difference]: With dead ends: 142 [2019-02-28 10:39:12,018 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:39:12,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:39:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:39:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-28 10:39:12,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:39:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-28 10:39:12,022 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-28 10:39:12,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:12,022 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-28 10:39:12,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:39:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-28 10:39:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-28 10:39:12,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:12,023 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-28 10:39:12,023 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:12,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-28 10:39:12,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:12,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:12,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-28 10:39:13,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:13,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:13,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:13,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:13,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:13,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:13,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:13,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:13,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:13,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:13,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:39:13,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-28 10:39:13,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-28 10:39:16,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-28 10:39:16,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:16,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:39:16,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:39:16,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:16,712 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-28 10:39:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:16,946 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-28 10:39:16,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:39:16,947 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-28 10:39:16,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:16,948 INFO L225 Difference]: With dead ends: 145 [2019-02-28 10:39:16,948 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:39:16,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:39:16,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:39:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-28 10:39:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:39:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-28 10:39:16,952 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-28 10:39:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:16,952 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-28 10:39:16,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:39:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-28 10:39:16,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:39:16,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:16,953 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-28 10:39:16,954 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:16,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:16,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-28 10:39:16,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:16,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:16,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-28 10:39:18,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:18,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:18,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:18,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:18,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:18,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:18,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:18,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:18,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:39:18,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-28 10:39:18,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-28 10:39:20,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:20,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-28 10:39:20,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:20,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:39:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:39:20,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:39:20,854 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-28 10:39:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:21,037 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-28 10:39:21,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:39:21,038 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-28 10:39:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:21,039 INFO L225 Difference]: With dead ends: 148 [2019-02-28 10:39:21,039 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:39:21,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:39:21,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:39:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-28 10:39:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-28 10:39:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-28 10:39:21,043 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-28 10:39:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:21,043 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-28 10:39:21,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:39:21,043 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-28 10:39:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-28 10:39:21,044 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:21,044 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-28 10:39:21,044 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-28 10:39:21,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:21,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:21,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-28 10:39:21,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:21,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:21,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:21,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:21,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:21,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:21,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:21,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:22,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:39:22,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:22,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:39:22,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-28 10:39:22,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-28 10:39:25,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:25,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-28 10:39:25,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:25,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:39:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:39:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:39:25,304 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-28 10:39:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:25,501 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-28 10:39:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:39:25,501 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-28 10:39:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:25,502 INFO L225 Difference]: With dead ends: 151 [2019-02-28 10:39:25,502 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:39:25,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:39:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:39:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-28 10:39:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:39:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-28 10:39:25,506 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-28 10:39:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:25,506 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-28 10:39:25,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:39:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-28 10:39:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:39:25,507 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:25,507 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-28 10:39:25,507 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-28 10:39:25,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:25,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:25,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:25,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-28 10:39:26,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:26,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:26,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:26,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:26,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:26,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:26,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:26,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:26,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:26,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:26,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:39:26,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-28 10:39:26,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-28 10:39:29,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:29,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-28 10:39:29,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:29,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:39:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:39:29,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:39:29,083 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-28 10:39:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:29,355 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-28 10:39:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:39:29,355 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-28 10:39:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:29,356 INFO L225 Difference]: With dead ends: 154 [2019-02-28 10:39:29,356 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:39:29,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:39:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:39:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-28 10:39:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:39:29,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-28 10:39:29,360 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-28 10:39:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:29,360 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-28 10:39:29,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:39:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-28 10:39:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-28 10:39:29,361 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:29,361 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-28 10:39:29,361 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:29,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-28 10:39:29,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:29,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:29,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:29,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:29,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-28 10:39:30,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:30,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:30,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:30,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:30,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:30,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:30,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:30,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:30,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-28 10:39:30,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-28 10:39:30,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-28 10:39:33,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:33,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-28 10:39:33,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:33,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:39:33,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:39:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:39:33,469 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-28 10:39:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:33,723 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-28 10:39:33,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:39:33,723 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-28 10:39:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:33,724 INFO L225 Difference]: With dead ends: 157 [2019-02-28 10:39:33,724 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:39:33,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:39:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:39:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-28 10:39:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:39:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-28 10:39:33,727 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-28 10:39:33,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:33,728 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-28 10:39:33,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:39:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-28 10:39:33,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:39:33,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:33,728 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-28 10:39:33,729 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:33,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-28 10:39:33,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:33,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:33,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-28 10:39:35,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:35,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:35,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:35,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:35,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:35,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:35,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:35,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:36,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-28 10:39:36,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:36,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:39:36,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:36,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-28 10:39:36,265 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-28 10:39:39,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:39,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-28 10:39:39,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:39,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:39:39,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:39:39,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:39:39,008 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-28 10:39:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:39,814 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-28 10:39:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:39:39,815 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-28 10:39:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:39,816 INFO L225 Difference]: With dead ends: 160 [2019-02-28 10:39:39,816 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:39:39,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:39:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:39:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-28 10:39:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:39:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-28 10:39:39,820 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-28 10:39:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:39,820 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-28 10:39:39,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:39:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-28 10:39:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:39:39,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:39,821 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-28 10:39:39,821 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:39,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-28 10:39:39,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:39,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:39,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-28 10:39:41,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:41,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:41,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:41,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:41,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:41,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:41,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:41,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:41,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:41,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-28 10:39:41,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-28 10:39:41,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-28 10:39:44,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:44,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-28 10:39:44,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:44,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:39:44,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:39:44,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:39:44,070 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-28 10:39:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:44,312 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-28 10:39:44,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:39:44,313 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-28 10:39:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:44,314 INFO L225 Difference]: With dead ends: 163 [2019-02-28 10:39:44,314 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:39:44,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:39:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:39:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-28 10:39:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:39:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-28 10:39:44,318 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-28 10:39:44,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:44,318 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-28 10:39:44,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:39:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-28 10:39:44,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:39:44,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:44,319 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-28 10:39:44,319 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:44,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:44,320 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-28 10:39:44,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:44,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:44,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:44,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-28 10:39:46,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:46,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:46,252 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:46,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:46,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:46,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:46,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:46,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:46,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:39:46,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-28 10:39:46,353 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-28 10:39:49,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:49,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-28 10:39:49,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:49,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:39:49,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:39:49,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:39:49,292 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-28 10:39:49,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:49,556 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-28 10:39:49,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:39:49,556 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-28 10:39:49,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:49,557 INFO L225 Difference]: With dead ends: 166 [2019-02-28 10:39:49,557 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:39:49,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:39:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:39:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-28 10:39:49,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:39:49,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-28 10:39:49,560 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-28 10:39:49,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:49,560 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-28 10:39:49,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:39:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-28 10:39:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:39:49,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:49,561 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-28 10:39:49,561 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-28 10:39:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:49,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:49,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-28 10:39:51,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:51,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:51,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:51,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:51,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:51,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:51,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:51,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:52,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-28 10:39:52,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:52,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:39:52,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-28 10:39:52,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-28 10:39:55,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:55,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-28 10:39:55,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:55,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:39:55,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:39:55,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:39:55,474 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-28 10:39:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:55,801 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-28 10:39:55,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:39:55,802 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-28 10:39:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:55,802 INFO L225 Difference]: With dead ends: 169 [2019-02-28 10:39:55,802 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:39:55,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:39:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:39:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-28 10:39:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:39:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-28 10:39:55,806 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-28 10:39:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:55,806 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-28 10:39:55,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:39:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-28 10:39:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-28 10:39:55,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:55,807 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-28 10:39:55,807 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:55,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:55,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-28 10:39:55,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:55,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:55,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-28 10:39:57,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:57,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:57,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:57,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:57,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:57,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:39:57,110 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:57,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:57,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:57,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:57,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:39:57,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:57,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-28 10:39:57,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-28 10:40:00,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:00,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-28 10:40:00,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:00,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:40:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:40:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:40:00,393 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-28 10:40:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:00,736 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-28 10:40:00,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:40:00,737 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-28 10:40:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:00,738 INFO L225 Difference]: With dead ends: 172 [2019-02-28 10:40:00,738 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:40:00,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:40:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:40:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-28 10:40:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-28 10:40:00,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-28 10:40:00,742 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-28 10:40:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:00,742 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-28 10:40:00,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:40:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-28 10:40:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-28 10:40:00,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:00,743 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-28 10:40:00,743 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:00,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-28 10:40:00,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:00,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:00,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:00,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:00,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-28 10:40:02,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:02,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:02,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:02,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:02,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:02,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:02,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:02,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:02,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-28 10:40:02,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-28 10:40:02,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-28 10:40:05,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:05,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-28 10:40:05,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:05,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:40:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:40:05,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:40:05,548 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-28 10:40:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:06,033 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-28 10:40:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:40:06,033 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-28 10:40:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:06,034 INFO L225 Difference]: With dead ends: 175 [2019-02-28 10:40:06,034 INFO L226 Difference]: Without dead ends: 117 [2019-02-28 10:40:06,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:40:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-28 10:40:06,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-28 10:40:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-28 10:40:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-28 10:40:06,038 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-28 10:40:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:06,038 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-28 10:40:06,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:40:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-28 10:40:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-28 10:40:06,038 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:06,038 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-28 10:40:06,039 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:06,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:06,039 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-28 10:40:06,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:06,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:06,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:06,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:06,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:07,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-28 10:40:07,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:07,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:07,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:07,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:07,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:07,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:07,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:07,328 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:08,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-28 10:40:08,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:08,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:40:08,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-28 10:40:08,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-28 10:40:11,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:11,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-28 10:40:11,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:11,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:40:11,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:40:11,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:40:11,926 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-28 10:40:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:12,289 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-28 10:40:12,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:40:12,290 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-28 10:40:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:12,290 INFO L225 Difference]: With dead ends: 178 [2019-02-28 10:40:12,290 INFO L226 Difference]: Without dead ends: 119 [2019-02-28 10:40:12,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:40:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-28 10:40:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-28 10:40:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-28 10:40:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-28 10:40:12,294 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-28 10:40:12,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:12,294 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-28 10:40:12,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:40:12,294 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-28 10:40:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-28 10:40:12,295 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:12,295 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-28 10:40:12,295 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:12,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-28 10:40:12,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:12,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:12,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:12,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:12,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:13,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-28 10:40:13,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:13,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:13,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:13,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:13,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:13,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:13,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:13,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:13,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:13,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:40:13,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-28 10:40:13,768 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-28 10:40:17,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:17,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-28 10:40:17,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:17,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:40:17,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:40:17,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:17,764 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-28 10:40:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:18,080 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-28 10:40:18,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:40:18,081 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-28 10:40:18,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:18,081 INFO L225 Difference]: With dead ends: 181 [2019-02-28 10:40:18,082 INFO L226 Difference]: Without dead ends: 121 [2019-02-28 10:40:18,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:40:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-28 10:40:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-28 10:40:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-28 10:40:18,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-28 10:40:18,085 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-28 10:40:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:18,085 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-28 10:40:18,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:40:18,086 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-28 10:40:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-28 10:40:18,086 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:18,086 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-28 10:40:18,087 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-28 10:40:18,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:18,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:18,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:18,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:18,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-28 10:40:19,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:19,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:19,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:19,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:19,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:19,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:19,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:19,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-28 10:40:19,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-28 10:40:19,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-28 10:40:23,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:23,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-28 10:40:23,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:23,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-28 10:40:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-28 10:40:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:40:23,466 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-28 10:40:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:23,861 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-28 10:40:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:40:23,861 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-28 10:40:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:23,862 INFO L225 Difference]: With dead ends: 184 [2019-02-28 10:40:23,862 INFO L226 Difference]: Without dead ends: 123 [2019-02-28 10:40:23,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:40:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-28 10:40:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-28 10:40:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-28 10:40:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-28 10:40:23,866 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-28 10:40:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:23,866 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-28 10:40:23,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-28 10:40:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-28 10:40:23,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-28 10:40:23,867 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:23,867 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-28 10:40:23,867 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:23,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:23,868 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-28 10:40:23,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:23,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:23,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:23,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:23,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-28 10:40:25,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:25,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:25,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:25,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:25,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:25,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:25,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:26,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-28 10:40:26,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:26,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:40:26,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-28 10:40:26,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-28 10:40:30,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-28 10:40:30,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:40:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:40:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:40:30,003 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-28 10:40:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:30,370 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-28 10:40:30,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:40:30,370 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-28 10:40:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:30,371 INFO L225 Difference]: With dead ends: 187 [2019-02-28 10:40:30,371 INFO L226 Difference]: Without dead ends: 125 [2019-02-28 10:40:30,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:40:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-28 10:40:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-28 10:40:30,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-28 10:40:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-28 10:40:30,375 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-28 10:40:30,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:30,376 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-28 10:40:30,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:40:30,376 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-28 10:40:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-28 10:40:30,377 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:30,377 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-28 10:40:30,377 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:30,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-28 10:40:30,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:30,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:30,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:30,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:30,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-28 10:40:32,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:32,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:32,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:32,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:32,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:32,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:32,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:32,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:32,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:32,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:40:32,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:32,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-28 10:40:32,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-28 10:40:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:36,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-28 10:40:36,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:36,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-28 10:40:36,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-28 10:40:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:40:36,064 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-28 10:40:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:36,423 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-28 10:40:36,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:40:36,423 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-28 10:40:36,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:36,424 INFO L225 Difference]: With dead ends: 190 [2019-02-28 10:40:36,424 INFO L226 Difference]: Without dead ends: 127 [2019-02-28 10:40:36,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:40:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-28 10:40:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-28 10:40:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-28 10:40:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-28 10:40:36,428 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-28 10:40:36,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:36,429 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-28 10:40:36,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-28 10:40:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-28 10:40:36,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-28 10:40:36,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:36,429 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-28 10:40:36,429 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:36,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-28 10:40:36,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:36,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:36,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:36,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-28 10:40:37,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:37,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:37,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:37,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:37,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:37,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:37,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:37,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:38,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:40:38,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-28 10:40:38,074 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-28 10:40:42,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:42,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-28 10:40:42,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:42,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:40:42,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:40:42,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:40:42,390 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-28 10:40:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:42,794 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-28 10:40:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:40:42,794 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-28 10:40:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:42,795 INFO L225 Difference]: With dead ends: 193 [2019-02-28 10:40:42,795 INFO L226 Difference]: Without dead ends: 129 [2019-02-28 10:40:42,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:40:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-28 10:40:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-28 10:40:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-28 10:40:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-28 10:40:42,798 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-28 10:40:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:42,798 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-28 10:40:42,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:40:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-28 10:40:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-28 10:40:42,799 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:42,799 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-28 10:40:42,799 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-28 10:40:42,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:42,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:42,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:42,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:42,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-28 10:40:44,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:44,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:44,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:44,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:44,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:44,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:44,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:44,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:45,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-28 10:40:45,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:45,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:40:45,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-28 10:40:45,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-28 10:40:49,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:49,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-28 10:40:49,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:49,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:40:49,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:40:49,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:40:49,645 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-28 10:40:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:50,062 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-28 10:40:50,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:40:50,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-28 10:40:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:50,063 INFO L225 Difference]: With dead ends: 196 [2019-02-28 10:40:50,063 INFO L226 Difference]: Without dead ends: 131 [2019-02-28 10:40:50,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:40:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-28 10:40:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-28 10:40:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-28 10:40:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-28 10:40:50,067 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-28 10:40:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:50,067 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-28 10:40:50,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:40:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-28 10:40:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-28 10:40:50,068 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:50,068 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-28 10:40:50,068 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:50,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-28 10:40:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:50,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:50,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-28 10:40:51,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:51,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:51,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:51,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:51,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:51,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:51,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:51,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:51,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:51,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:51,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:40:51,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-28 10:40:51,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-28 10:40:55,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:55,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-28 10:40:55,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:55,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:40:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:40:55,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:40:55,930 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-28 10:40:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:56,381 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-28 10:40:56,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:40:56,382 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-28 10:40:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:56,382 INFO L225 Difference]: With dead ends: 199 [2019-02-28 10:40:56,382 INFO L226 Difference]: Without dead ends: 133 [2019-02-28 10:40:56,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:40:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-28 10:40:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-28 10:40:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-28 10:40:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-28 10:40:56,386 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-28 10:40:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:56,387 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-28 10:40:56,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:40:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-28 10:40:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-28 10:40:56,387 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:56,388 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-28 10:40:56,388 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:56,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-28 10:40:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:56,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:56,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:56,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-28 10:40:58,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:58,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:58,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:58,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:58,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:58,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:40:58,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:58,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:58,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:40:58,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-28 10:40:58,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-28 10:41:03,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:03,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-28 10:41:03,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:03,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-28 10:41:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-28 10:41:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:41:03,762 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-28 10:41:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:04,276 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-28 10:41:04,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:41:04,276 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-28 10:41:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:04,277 INFO L225 Difference]: With dead ends: 202 [2019-02-28 10:41:04,277 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:41:04,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:41:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:41:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-28 10:41:04,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-28 10:41:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-28 10:41:04,281 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-28 10:41:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:04,281 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-28 10:41:04,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-28 10:41:04,281 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-28 10:41:04,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-28 10:41:04,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:04,282 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-28 10:41:04,282 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:04,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:04,282 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-28 10:41:04,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:04,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:04,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:04,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:04,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-28 10:41:05,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:05,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:05,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:05,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:05,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:05,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:05,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:05,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:08,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-28 10:41:08,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:08,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:41:08,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-28 10:41:08,872 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-28 10:41:14,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:14,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-28 10:41:14,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:14,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:41:14,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:41:14,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:41:14,271 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-28 10:41:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:14,679 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-28 10:41:14,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:41:14,679 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-28 10:41:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:14,680 INFO L225 Difference]: With dead ends: 205 [2019-02-28 10:41:14,680 INFO L226 Difference]: Without dead ends: 137 [2019-02-28 10:41:14,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:41:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-28 10:41:14,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-28 10:41:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-28 10:41:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-28 10:41:14,684 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-28 10:41:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:14,684 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-28 10:41:14,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:41:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-28 10:41:14,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-28 10:41:14,685 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:14,685 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-28 10:41:14,685 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:14,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:14,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-28 10:41:14,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:14,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:14,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:14,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:14,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-28 10:41:16,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:16,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:16,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:16,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:16,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:16,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:16,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:16,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:16,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:16,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:16,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:41:16,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-28 10:41:16,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-28 10:41:21,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:21,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-28 10:41:21,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:21,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-28 10:41:21,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-28 10:41:21,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:41:21,343 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-28 10:41:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:21,882 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-28 10:41:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:41:21,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-28 10:41:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:21,883 INFO L225 Difference]: With dead ends: 208 [2019-02-28 10:41:21,883 INFO L226 Difference]: Without dead ends: 139 [2019-02-28 10:41:21,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:41:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-28 10:41:21,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-28 10:41:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-28 10:41:21,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-28 10:41:21,887 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-28 10:41:21,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:21,887 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-28 10:41:21,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-28 10:41:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-28 10:41:21,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-28 10:41:21,888 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:21,888 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-28 10:41:21,889 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:21,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:21,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-28 10:41:21,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:21,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:21,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:21,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-28 10:41:23,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:23,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:23,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:23,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:23,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:23,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:23,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:23,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:23,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-28 10:41:23,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-28 10:41:23,976 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-28 10:41:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:28,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-28 10:41:28,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:28,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:41:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:41:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:41:28,998 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-28 10:41:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:29,554 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-28 10:41:29,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:41:29,554 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-28 10:41:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:29,555 INFO L225 Difference]: With dead ends: 211 [2019-02-28 10:41:29,555 INFO L226 Difference]: Without dead ends: 141 [2019-02-28 10:41:29,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:41:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-28 10:41:29,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-28 10:41:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-28 10:41:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-28 10:41:29,559 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-28 10:41:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:29,559 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-28 10:41:29,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:41:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-28 10:41:29,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-28 10:41:29,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:29,560 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-28 10:41:29,560 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:29,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-28 10:41:29,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:29,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:29,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:29,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:29,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-28 10:41:31,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:31,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:31,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:31,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:31,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:31,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:31,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:31,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:34,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-28 10:41:34,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:34,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:41:34,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-28 10:41:34,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-28 10:41:40,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:40,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-28 10:41:40,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:40,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:41:40,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:41:40,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:41:40,074 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-28 10:41:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:40,671 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-28 10:41:40,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:41:40,672 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-28 10:41:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:40,672 INFO L225 Difference]: With dead ends: 214 [2019-02-28 10:41:40,672 INFO L226 Difference]: Without dead ends: 143 [2019-02-28 10:41:40,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:41:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-28 10:41:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-28 10:41:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-28 10:41:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-28 10:41:40,676 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-28 10:41:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:40,676 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-28 10:41:40,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:41:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-28 10:41:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-28 10:41:40,677 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:40,677 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-28 10:41:40,677 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:40,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-28 10:41:40,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:40,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:40,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-28 10:41:42,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:42,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:42,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:42,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:42,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:42,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:42,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:42,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:42,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:42,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:42,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-28 10:41:42,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-28 10:41:42,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-28 10:41:47,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-28 10:41:47,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:47,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:41:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:41:47,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:41:47,787 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-28 10:41:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:48,350 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-28 10:41:48,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:41:48,351 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-28 10:41:48,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:48,352 INFO L225 Difference]: With dead ends: 217 [2019-02-28 10:41:48,352 INFO L226 Difference]: Without dead ends: 145 [2019-02-28 10:41:48,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:41:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-28 10:41:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-28 10:41:48,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-28 10:41:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-28 10:41:48,356 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-28 10:41:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:48,356 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-28 10:41:48,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:41:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-28 10:41:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-28 10:41:48,357 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:48,357 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-28 10:41:48,357 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-28 10:41:48,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:48,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:48,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:48,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:48,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-28 10:41:50,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:50,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:50,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:50,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:50,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:50,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:50,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:50,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:50,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 715 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:41:50,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-28 10:41:50,417 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-28 10:41:55,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:55,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-28 10:41:55,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:55,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-28 10:41:55,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-28 10:41:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:41:55,790 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-28 10:41:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:56,258 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-28 10:41:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:41:56,258 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-28 10:41:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:56,259 INFO L225 Difference]: With dead ends: 220 [2019-02-28 10:41:56,259 INFO L226 Difference]: Without dead ends: 147 [2019-02-28 10:41:56,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:41:56,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-28 10:41:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-28 10:41:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-28 10:41:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-28 10:41:56,264 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-28 10:41:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:56,264 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-28 10:41:56,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-28 10:41:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-28 10:41:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-28 10:41:56,265 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:56,265 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-28 10:41:56,265 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-28 10:41:56,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:56,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:56,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:56,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-28 10:41:58,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:58,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:58,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:58,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:41:58,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:58,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:41:58,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:58,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:00,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-28 10:42:00,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:00,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:42:00,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-28 10:42:00,886 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-28 10:42:06,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:06,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-28 10:42:06,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:06,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:42:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:42:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:42:06,414 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-28 10:42:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:07,043 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-28 10:42:07,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:42:07,043 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-28 10:42:07,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:07,044 INFO L225 Difference]: With dead ends: 223 [2019-02-28 10:42:07,044 INFO L226 Difference]: Without dead ends: 149 [2019-02-28 10:42:07,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:42:07,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-28 10:42:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-28 10:42:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-28 10:42:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-28 10:42:07,048 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-28 10:42:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:07,048 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-28 10:42:07,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:42:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-28 10:42:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-28 10:42:07,049 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:07,049 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-28 10:42:07,050 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:07,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:07,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-28 10:42:07,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:07,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:07,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:07,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-28 10:42:09,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:09,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:09,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:09,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:09,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:09,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:09,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:09,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:09,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:09,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:42:09,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-28 10:42:09,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:15,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-28 10:42:15,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:15,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-28 10:42:15,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:15,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:42:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:42:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:42:15,195 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-28 10:42:15,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:15,780 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-28 10:42:15,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:42:15,780 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-28 10:42:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:15,781 INFO L225 Difference]: With dead ends: 226 [2019-02-28 10:42:15,781 INFO L226 Difference]: Without dead ends: 151 [2019-02-28 10:42:15,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:42:15,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-28 10:42:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-28 10:42:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-28 10:42:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-28 10:42:15,785 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-28 10:42:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:15,785 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-28 10:42:15,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:42:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-28 10:42:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-28 10:42:15,786 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:15,787 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-28 10:42:15,787 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-28 10:42:15,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:15,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:15,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:15,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:17,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-28 10:42:17,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:17,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:17,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:17,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:17,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:17,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:17,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:17,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:17,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:42:17,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-28 10:42:17,973 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-28 10:42:24,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:24,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-28 10:42:24,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:24,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:42:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:42:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:42:24,067 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-28 10:42:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:24,669 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-28 10:42:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:42:24,669 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-28 10:42:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:24,670 INFO L225 Difference]: With dead ends: 229 [2019-02-28 10:42:24,670 INFO L226 Difference]: Without dead ends: 153 [2019-02-28 10:42:24,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:42:24,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-28 10:42:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-28 10:42:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-28 10:42:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-28 10:42:24,674 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-28 10:42:24,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:24,675 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-28 10:42:24,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:42:24,675 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-28 10:42:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-28 10:42:24,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:24,676 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-28 10:42:24,676 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-28 10:42:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:24,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:24,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:24,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:24,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-28 10:42:26,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:26,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:26,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:26,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:26,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:26,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:26,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:26,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:28,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-28 10:42:28,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:28,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:42:28,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:28,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-28 10:42:28,910 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-28 10:42:35,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:35,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-28 10:42:35,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:35,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:42:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:42:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:42:35,109 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-28 10:42:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:35,764 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-28 10:42:35,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:42:35,764 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-28 10:42:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:35,765 INFO L225 Difference]: With dead ends: 232 [2019-02-28 10:42:35,765 INFO L226 Difference]: Without dead ends: 155 [2019-02-28 10:42:35,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:42:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-28 10:42:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-28 10:42:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-28 10:42:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-28 10:42:35,768 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-28 10:42:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:35,768 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-28 10:42:35,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:42:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-28 10:42:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-28 10:42:35,769 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:35,769 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-28 10:42:35,769 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-28 10:42:35,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:35,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:35,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:35,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-28 10:42:37,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:37,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:37,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:37,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:37,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:37,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:37,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:37,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:37,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:37,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:37,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-28 10:42:37,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-28 10:42:37,995 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-28 10:42:44,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:44,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-28 10:42:44,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:44,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:42:44,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:42:44,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:42:44,006 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-28 10:42:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:44,718 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-28 10:42:44,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:42:44,718 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-28 10:42:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:44,719 INFO L225 Difference]: With dead ends: 235 [2019-02-28 10:42:44,719 INFO L226 Difference]: Without dead ends: 157 [2019-02-28 10:42:44,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:42:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-28 10:42:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-28 10:42:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-28 10:42:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-28 10:42:44,722 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-28 10:42:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:44,723 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-28 10:42:44,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:42:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-28 10:42:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-28 10:42:44,723 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:44,723 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-28 10:42:44,723 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:44,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-28 10:42:44,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:44,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:44,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:44,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:44,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:46,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-28 10:42:46,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:46,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:46,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:46,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:46,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:46,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:46,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:46,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:46,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:42:46,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-28 10:42:47,005 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-28 10:42:53,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:53,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-28 10:42:53,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:53,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-28 10:42:53,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-28 10:42:53,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:42:53,382 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-28 10:42:54,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:54,040 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-28 10:42:54,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:42:54,041 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-28 10:42:54,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:54,041 INFO L225 Difference]: With dead ends: 238 [2019-02-28 10:42:54,042 INFO L226 Difference]: Without dead ends: 159 [2019-02-28 10:42:54,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:42:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-28 10:42:54,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-28 10:42:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-28 10:42:54,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-28 10:42:54,046 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-28 10:42:54,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:54,046 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-28 10:42:54,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-28 10:42:54,047 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-28 10:42:54,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-28 10:42:54,047 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:54,047 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-28 10:42:54,048 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:54,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-28 10:42:54,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:54,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:54,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:54,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:54,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-28 10:42:56,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:56,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:56,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:56,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:56,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:56,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:56,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:56,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:00,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-28 10:43:00,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:00,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:43:00,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-28 10:43:00,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-28 10:43:07,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:07,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-28 10:43:07,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:07,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:43:07,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:43:07,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:43:07,486 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-28 10:43:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:08,292 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-28 10:43:08,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:43:08,293 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-28 10:43:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:08,293 INFO L225 Difference]: With dead ends: 241 [2019-02-28 10:43:08,293 INFO L226 Difference]: Without dead ends: 161 [2019-02-28 10:43:08,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:43:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-28 10:43:08,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-28 10:43:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-28 10:43:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-28 10:43:08,299 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-28 10:43:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:08,299 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-28 10:43:08,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:43:08,299 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-28 10:43:08,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-28 10:43:08,300 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:08,300 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-28 10:43:08,300 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-28 10:43:08,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:08,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:08,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:08,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-28 10:43:10,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:10,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:10,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:10,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:10,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:10,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:10,779 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:10,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:10,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:10,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:10,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:43:10,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-28 10:43:10,912 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-28 10:43:17,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:17,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-28 10:43:17,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:17,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-28 10:43:17,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-28 10:43:17,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:43:17,643 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-28 10:43:18,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:18,498 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-28 10:43:18,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:43:18,498 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-28 10:43:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:18,499 INFO L225 Difference]: With dead ends: 244 [2019-02-28 10:43:18,499 INFO L226 Difference]: Without dead ends: 163 [2019-02-28 10:43:18,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:43:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-28 10:43:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-28 10:43:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-28 10:43:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-28 10:43:18,504 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-28 10:43:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:18,504 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-28 10:43:18,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-28 10:43:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-28 10:43:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-28 10:43:18,505 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:18,505 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-28 10:43:18,505 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-28 10:43:18,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:18,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:18,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:18,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:18,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-28 10:43:21,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:21,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:21,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:21,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:21,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:21,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:21,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:21,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-28 10:43:21,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-28 10:43:21,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:28,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-28 10:43:28,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:28,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-28 10:43:28,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:28,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:43:28,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:43:28,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:43:28,341 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-28 10:43:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:29,238 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-28 10:43:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:43:29,238 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-28 10:43:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:29,239 INFO L225 Difference]: With dead ends: 247 [2019-02-28 10:43:29,239 INFO L226 Difference]: Without dead ends: 165 [2019-02-28 10:43:29,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:43:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-28 10:43:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-28 10:43:29,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-28 10:43:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-28 10:43:29,243 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-28 10:43:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:29,243 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-28 10:43:29,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:43:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-28 10:43:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-28 10:43:29,244 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:29,244 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-28 10:43:29,244 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:29,245 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-28 10:43:29,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:29,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:29,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:29,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:29,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-28 10:43:31,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:31,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:31,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:31,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:31,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:31,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:31,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:31,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:34,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-28 10:43:34,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:34,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 815 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:43:34,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-28 10:43:34,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-28 10:43:42,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:42,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-28 10:43:42,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:42,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:43:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:43:42,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:43:42,174 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-28 10:43:43,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:43,077 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-28 10:43:43,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:43:43,077 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-28 10:43:43,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:43,078 INFO L225 Difference]: With dead ends: 250 [2019-02-28 10:43:43,078 INFO L226 Difference]: Without dead ends: 167 [2019-02-28 10:43:43,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:43:43,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-28 10:43:43,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-28 10:43:43,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-28 10:43:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-28 10:43:43,082 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-28 10:43:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:43,082 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-28 10:43:43,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:43:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-28 10:43:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-28 10:43:43,082 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:43,083 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-28 10:43:43,083 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:43,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-28 10:43:43,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:43,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:43,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:43,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:43,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-28 10:43:45,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:45,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:45,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:45,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:45,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:45,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:45,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:45,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:45,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:45,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:45,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:43:45,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-28 10:43:45,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-28 10:43:53,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:53,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-28 10:43:53,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:53,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:43:53,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:43:53,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:43:53,016 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-28 10:43:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:53,760 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-28 10:43:53,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:43:53,760 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-28 10:43:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:53,761 INFO L225 Difference]: With dead ends: 253 [2019-02-28 10:43:53,761 INFO L226 Difference]: Without dead ends: 169 [2019-02-28 10:43:53,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:43:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-28 10:43:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-28 10:43:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-28 10:43:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-28 10:43:53,765 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-28 10:43:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:53,765 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-28 10:43:53,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:43:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-28 10:43:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-28 10:43:53,766 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:53,766 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-28 10:43:53,766 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-28 10:43:53,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:53,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-28 10:43:56,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:56,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:56,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:56,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:56,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:56,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:56,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:56,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:56,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-28 10:43:56,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-28 10:43:56,637 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-28 10:44:03,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:03,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-28 10:44:03,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:03,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-28 10:44:03,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-28 10:44:03,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:44:03,825 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-28 10:44:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:04,772 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-28 10:44:04,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:44:04,772 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-28 10:44:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:04,773 INFO L225 Difference]: With dead ends: 256 [2019-02-28 10:44:04,773 INFO L226 Difference]: Without dead ends: 171 [2019-02-28 10:44:04,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:44:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-28 10:44:04,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-28 10:44:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-28 10:44:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-28 10:44:04,777 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-28 10:44:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:04,777 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-28 10:44:04,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-28 10:44:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-28 10:44:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-28 10:44:04,778 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:04,778 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-28 10:44:04,778 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-28 10:44:04,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:04,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:04,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:04,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-28 10:44:07,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:07,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:07,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:07,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:07,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:07,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:16,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-28 10:44:16,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:16,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:44:16,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-28 10:44:16,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-28 10:44:23,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:23,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-28 10:44:23,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:23,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:44:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:44:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:44:23,901 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-28 10:44:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:24,927 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-28 10:44:24,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:44:24,927 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-28 10:44:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:24,928 INFO L225 Difference]: With dead ends: 259 [2019-02-28 10:44:24,928 INFO L226 Difference]: Without dead ends: 173 [2019-02-28 10:44:24,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:44:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-28 10:44:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-28 10:44:24,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-28 10:44:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-28 10:44:24,932 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-28 10:44:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:24,932 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-28 10:44:24,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:44:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-28 10:44:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-28 10:44:24,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:24,933 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-28 10:44:24,934 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-28 10:44:24,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:24,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:24,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:24,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-28 10:44:27,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:27,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:27,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:27,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:27,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:27,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:27,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:27,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:27,910 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:27,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:27,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:44:27,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-28 10:44:27,937 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-28 10:44:35,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:35,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-28 10:44:35,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:35,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-28 10:44:35,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-28 10:44:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:44:35,507 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-28 10:44:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:36,576 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-28 10:44:36,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:44:36,577 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-28 10:44:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:36,577 INFO L225 Difference]: With dead ends: 262 [2019-02-28 10:44:36,577 INFO L226 Difference]: Without dead ends: 175 [2019-02-28 10:44:36,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:44:36,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-28 10:44:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-28 10:44:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-28 10:44:36,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-28 10:44:36,583 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-28 10:44:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:36,583 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-28 10:44:36,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-28 10:44:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-28 10:44:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-28 10:44:36,584 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:36,584 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-28 10:44:36,584 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:36,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-28 10:44:36,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:36,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-28 10:44:39,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:39,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:39,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:39,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:39,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:39,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:39,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:39,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:39,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-28 10:44:39,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-28 10:44:39,762 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-28 10:44:47,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:47,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-28 10:44:47,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:47,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:44:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:44:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:44:47,840 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-28 10:44:48,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:48,935 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-28 10:44:48,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:44:48,935 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-28 10:44:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:48,936 INFO L225 Difference]: With dead ends: 265 [2019-02-28 10:44:48,936 INFO L226 Difference]: Without dead ends: 177 [2019-02-28 10:44:48,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:44:48,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-28 10:44:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-28 10:44:48,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-28 10:44:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-28 10:44:48,940 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-28 10:44:48,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:48,940 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-28 10:44:48,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:44:48,941 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-28 10:44:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-28 10:44:48,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:48,941 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-28 10:44:48,942 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:48,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:48,942 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-28 10:44:48,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:48,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:48,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:48,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-28 10:44:51,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:51,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:51,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:51,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:51,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:51,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:51,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:51,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:00,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-28 10:45:00,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:00,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:45:00,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:00,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-28 10:45:00,663 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:08,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-28 10:45:08,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:08,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-28 10:45:08,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:08,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:45:08,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:45:08,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:45:08,897 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-28 10:45:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:09,838 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-28 10:45:09,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:45:09,839 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-28 10:45:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:09,840 INFO L225 Difference]: With dead ends: 268 [2019-02-28 10:45:09,840 INFO L226 Difference]: Without dead ends: 179 [2019-02-28 10:45:09,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:45:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-28 10:45:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-28 10:45:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-28 10:45:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-28 10:45:09,844 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-28 10:45:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:09,844 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-28 10:45:09,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:45:09,844 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-28 10:45:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-28 10:45:09,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:09,845 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-28 10:45:09,845 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:09,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:09,845 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-28 10:45:09,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:09,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:09,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:09,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:09,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-28 10:45:12,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:12,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:12,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:12,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:12,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:12,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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:12,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:12,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:12,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:12,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:12,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-28 10:45:12,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-28 10:45:12,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:21,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-28 10:45:21,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:21,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-28 10:45:21,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:21,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:45:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:45:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:45:21,176 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-28 10:45:22,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:22,359 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-28 10:45:22,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-28 10:45:22,359 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-28 10:45:22,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:22,360 INFO L225 Difference]: With dead ends: 271 [2019-02-28 10:45:22,360 INFO L226 Difference]: Without dead ends: 181 [2019-02-28 10:45:22,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:45:22,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-28 10:45:22,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-28 10:45:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-28 10:45:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-28 10:45:22,365 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-28 10:45:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:22,365 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-28 10:45:22,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:45:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-28 10:45:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-28 10:45:22,366 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:22,366 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-28 10:45:22,366 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-28 10:45:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:22,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:22,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-28 10:45:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:25,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:25,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:25,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:25,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:25,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:25,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:45:25,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-28 10:45:25,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-28 10:45:34,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:34,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-28 10:45:34,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:34,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:45:34,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:45:34,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:45:34,186 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-28 10:45:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:35,150 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-28 10:45:35,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:45:35,150 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-28 10:45:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:35,151 INFO L225 Difference]: With dead ends: 274 [2019-02-28 10:45:35,151 INFO L226 Difference]: Without dead ends: 183 [2019-02-28 10:45:35,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:45:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-28 10:45:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-28 10:45:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-28 10:45:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-28 10:45:35,154 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-28 10:45:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:35,155 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-28 10:45:35,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:45:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-28 10:45:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-28 10:45:35,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:35,155 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-28 10:45:35,155 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:35,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-28 10:45:35,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:35,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:35,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-28 10:45:37,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:37,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:37,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:37,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:37,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:37,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:37,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:37,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:42,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-28 10:45:42,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:42,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:45:42,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:42,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-28 10:45:42,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:51,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-28 10:45:51,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:51,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-28 10:45:51,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:51,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:45:51,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:45:51,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:45:51,487 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-28 10:45:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:52,454 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-28 10:45:52,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:45:52,455 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-28 10:45:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:52,455 INFO L225 Difference]: With dead ends: 277 [2019-02-28 10:45:52,456 INFO L226 Difference]: Without dead ends: 185 [2019-02-28 10:45:52,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:45:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-28 10:45:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-28 10:45:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-28 10:45:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-28 10:45:52,460 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-28 10:45:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:52,460 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-28 10:45:52,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:45:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-28 10:45:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-28 10:45:52,461 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:52,461 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-28 10:45:52,461 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:52,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:52,461 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-28 10:45:52,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:52,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:52,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:52,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-28 10:45:55,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:55,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:55,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:55,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:55,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:55,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:55,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:55,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:55,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:55,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:55,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:45:55,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-28 10:45:55,806 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-28 10:46:04,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:04,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-28 10:46:04,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:04,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-28 10:46:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-28 10:46:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:46:04,871 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-28 10:46:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:05,903 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-28 10:46:05,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:46:05,904 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-28 10:46:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:05,904 INFO L225 Difference]: With dead ends: 280 [2019-02-28 10:46:05,904 INFO L226 Difference]: Without dead ends: 187 [2019-02-28 10:46:05,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:46:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-28 10:46:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-28 10:46:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-28 10:46:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-28 10:46:05,909 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-28 10:46:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:05,909 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-28 10:46:05,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-28 10:46:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-28 10:46:05,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-28 10:46:05,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:05,911 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-28 10:46:05,911 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-28 10:46:05,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:05,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:05,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:05,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:05,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-28 10:46:08,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:08,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:08,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:08,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:08,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:08,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:08,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:08,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:09,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-28 10:46:09,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:09,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-28 10:46:09,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-28 10:46:18,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:18,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-28 10:46:18,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:18,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:46:18,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:46:18,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:46:18,154 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-28 10:46:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:19,509 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-28 10:46:19,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-28 10:46:19,509 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-28 10:46:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:19,510 INFO L225 Difference]: With dead ends: 283 [2019-02-28 10:46:19,510 INFO L226 Difference]: Without dead ends: 189 [2019-02-28 10:46:19,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:46:19,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-28 10:46:19,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-28 10:46:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-28 10:46:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-28 10:46:19,515 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-28 10:46:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:19,515 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-28 10:46:19,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:46:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-28 10:46:19,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-28 10:46:19,516 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:19,516 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-28 10:46:19,516 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:19,517 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-28 10:46:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:19,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:19,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-28 10:46:22,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:22,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:22,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:22,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:22,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:22,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:22,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:22,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:27,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-28 10:46:27,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:27,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:46:27,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-28 10:46:27,658 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-28 10:46:37,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:37,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-28 10:46:37,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:37,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:46:37,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:46:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:46:37,004 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-28 10:46:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:38,203 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-28 10:46:38,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:46:38,203 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-28 10:46:38,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:38,204 INFO L225 Difference]: With dead ends: 286 [2019-02-28 10:46:38,204 INFO L226 Difference]: Without dead ends: 191 [2019-02-28 10:46:38,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:46:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-28 10:46:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-28 10:46:38,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-28 10:46:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-28 10:46:38,208 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-28 10:46:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:38,208 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-28 10:46:38,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:46:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-28 10:46:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-28 10:46:38,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:38,209 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-28 10:46:38,209 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-28 10:46:38,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:38,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:38,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:38,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:38,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-28 10:46:41,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:41,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:41,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:41,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:41,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:41,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:41,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:41,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:41,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:41,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:41,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:46:41,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-28 10:46:41,749 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-28 10:46:51,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:51,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-28 10:46:51,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:51,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:46:51,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:46:51,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:46:51,406 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-28 10:46:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:52,805 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-28 10:46:52,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-28 10:46:52,806 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-28 10:46:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:52,806 INFO L225 Difference]: With dead ends: 289 [2019-02-28 10:46:52,806 INFO L226 Difference]: Without dead ends: 193 [2019-02-28 10:46:52,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:46:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-28 10:46:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-28 10:46:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-28 10:46:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-28 10:46:52,810 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-28 10:46:52,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:52,810 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-28 10:46:52,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:46:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-28 10:46:52,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-28 10:46:52,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:52,811 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-28 10:46:52,811 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-28 10:46:52,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:52,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:52,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:52,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:52,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-28 10:46:56,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:56,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:56,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:56,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:56,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:56,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:56,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:56,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:56,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-28 10:46:56,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-28 10:46:56,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-28 10:47:06,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:06,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-28 10:47:06,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:06,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-28 10:47:06,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-28 10:47:06,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:47:06,429 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-28 10:47:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:07,871 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-28 10:47:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:47:07,871 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-28 10:47:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:07,872 INFO L225 Difference]: With dead ends: 292 [2019-02-28 10:47:07,872 INFO L226 Difference]: Without dead ends: 195 [2019-02-28 10:47:07,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:47:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-28 10:47:07,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-28 10:47:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-28 10:47:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-28 10:47:07,879 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-28 10:47:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:07,880 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-28 10:47:07,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-28 10:47:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-28 10:47:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-28 10:47:07,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:07,880 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-28 10:47:07,881 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:07,881 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-28 10:47:07,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:07,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:07,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:07,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:07,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:11,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-28 10:47:11,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:11,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:11,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:11,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:11,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:11,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:11,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:11,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:17,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-28 10:47:17,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:17,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:47:17,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-28 10:47:17,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:27,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-28 10:47:27,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:27,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-28 10:47:27,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:27,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:47:27,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:47:27,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:47:27,469 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-28 10:47:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:29,090 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-28 10:47:29,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:47:29,090 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-28 10:47:29,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:29,091 INFO L225 Difference]: With dead ends: 295 [2019-02-28 10:47:29,091 INFO L226 Difference]: Without dead ends: 197 [2019-02-28 10:47:29,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:47:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-28 10:47:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-28 10:47:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-28 10:47:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-28 10:47:29,096 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-28 10:47:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:29,096 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-28 10:47:29,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:47:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-28 10:47:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-28 10:47:29,097 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:29,097 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-28 10:47:29,098 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:29,098 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-28 10:47:29,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:29,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:29,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:29,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:29,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-28 10:47:32,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:32,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:32,833 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:32,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:32,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:32,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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:32,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:32,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:32,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:32,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:32,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:47:32,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-28 10:47:33,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-28 10:47:43,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:43,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-28 10:47:43,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:43,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-28 10:47:43,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-28 10:47:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:47:43,076 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-28 10:47:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:44,661 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-28 10:47:44,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:47:44,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-28 10:47:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:44,662 INFO L225 Difference]: With dead ends: 298 [2019-02-28 10:47:44,662 INFO L226 Difference]: Without dead ends: 199 [2019-02-28 10:47:44,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:47:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-28 10:47:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-28 10:47:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-28 10:47:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-28 10:47:44,666 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-28 10:47:44,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:44,666 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-28 10:47:44,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-28 10:47:44,666 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-28 10:47:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-28 10:47:44,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:44,667 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-28 10:47:44,667 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:44,667 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-28 10:47:44,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:44,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:44,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:44,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:44,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-28 10:47:48,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:48,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:48,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:48,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:48,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:48,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:48,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:48,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:48,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:47:48,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-28 10:47:48,678 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:58,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-28 10:47:58,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:58,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-28 10:47:58,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:58,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:47:58,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:47:58,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:47:58,731 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-28 10:48:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:00,005 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-28 10:48:00,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-28 10:48:00,005 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-28 10:48:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:00,006 INFO L225 Difference]: With dead ends: 301 [2019-02-28 10:48:00,006 INFO L226 Difference]: Without dead ends: 201 [2019-02-28 10:48:00,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:48:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-28 10:48:00,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-28 10:48:00,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-28 10:48:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-28 10:48:00,011 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-28 10:48:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:00,011 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-28 10:48:00,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:48:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-28 10:48:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-28 10:48:00,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:00,012 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-28 10:48:00,012 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:00,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:00,012 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-28 10:48:00,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:00,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:00,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:00,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:00,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-28 10:48:03,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:03,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:03,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:03,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:03,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:03,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:03,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:03,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:18,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-28 10:48:18,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:18,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:48:18,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-28 10:48:18,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-28 10:48:29,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:29,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-28 10:48:29,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:29,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:48:29,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:48:29,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:48:29,006 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-28 10:48:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:30,656 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-28 10:48:30,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:48:30,657 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-28 10:48:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:30,658 INFO L225 Difference]: With dead ends: 304 [2019-02-28 10:48:30,658 INFO L226 Difference]: Without dead ends: 203 [2019-02-28 10:48:30,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:48:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-28 10:48:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-28 10:48:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-28 10:48:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-28 10:48:30,661 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-28 10:48:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:30,661 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-28 10:48:30,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:48:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-28 10:48:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-28 10:48:30,662 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:30,662 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-28 10:48:30,662 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-28 10:48:30,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:30,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:30,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:30,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:30,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-28 10:48:34,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:34,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:34,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:34,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:34,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:34,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:34,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:34,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:34,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:34,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:34,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:48:34,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-28 10:48:34,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-28 10:48:45,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:45,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-28 10:48:45,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:45,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:48:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:48:45,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:48:45,266 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-28 10:48:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:46,963 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-28 10:48:46,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-28 10:48:46,964 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-28 10:48:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:46,965 INFO L225 Difference]: With dead ends: 307 [2019-02-28 10:48:46,965 INFO L226 Difference]: Without dead ends: 205 [2019-02-28 10:48:46,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:48:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-28 10:48:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-28 10:48:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-28 10:48:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-28 10:48:46,968 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-28 10:48:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:46,968 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-28 10:48:46,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:48:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-28 10:48:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-28 10:48:46,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:46,969 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-28 10:48:46,969 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-28 10:48:46,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:46,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:46,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:46,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:46,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-28 10:48:50,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:50,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:50,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:50,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:50,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:50,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:50,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:50,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:51,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:48:51,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-28 10:48:51,082 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:01,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-28 10:49:02,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:02,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-28 10:49:02,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:02,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-28 10:49:02,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-28 10:49:02,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:49:02,004 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-28 10:49:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:03,625 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-28 10:49:03,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:49:03,626 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-28 10:49:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:03,627 INFO L225 Difference]: With dead ends: 310 [2019-02-28 10:49:03,627 INFO L226 Difference]: Without dead ends: 207 [2019-02-28 10:49:03,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:49:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-28 10:49:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-28 10:49:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-28 10:49:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-28 10:49:03,632 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-28 10:49:03,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:03,632 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-28 10:49:03,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-28 10:49:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-28 10:49:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-28 10:49:03,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:03,634 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-28 10:49:03,634 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-28 10:49:03,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:03,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:03,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-28 10:49:07,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:07,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:07,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:07,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:07,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:07,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:07,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:49:07,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:49:25,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-28 10:49:25,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:25,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:49:25,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-28 10:49:25,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-28 10:49:36,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:36,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-28 10:49:36,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:36,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:49:36,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:49:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:49:36,898 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-28 10:49:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:38,821 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-28 10:49:38,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:49:38,821 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-28 10:49:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:38,822 INFO L225 Difference]: With dead ends: 313 [2019-02-28 10:49:38,823 INFO L226 Difference]: Without dead ends: 209 [2019-02-28 10:49:38,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:49:38,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-28 10:49:38,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-28 10:49:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-28 10:49:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-28 10:49:38,829 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-28 10:49:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:38,829 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-28 10:49:38,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:49:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-28 10:49:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-28 10:49:38,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:38,830 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-28 10:49:38,830 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-28 10:49:38,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:38,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:38,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-28 10:49:42,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:42,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:42,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:42,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:42,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:42,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:42,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:42,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:42,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:42,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:42,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-28 10:49:42,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-28 10:49:42,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-28 10:49:54,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:54,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-28 10:49:54,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:54,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:49:54,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:49:54,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:49:54,547 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-28 10:49:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:56,173 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-28 10:49:56,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-28 10:49:56,173 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-28 10:49:56,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:56,174 INFO L225 Difference]: With dead ends: 316 [2019-02-28 10:49:56,174 INFO L226 Difference]: Without dead ends: 211 [2019-02-28 10:49:56,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:49:56,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-28 10:49:56,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-28 10:49:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-28 10:49:56,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-28 10:49:56,179 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-28 10:49:56,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:56,180 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-28 10:49:56,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:49:56,180 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-28 10:49:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-28 10:49:56,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:56,181 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-28 10:49:56,181 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:56,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-28 10:49:56,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:56,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:56,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:56,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-28 10:50:00,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:00,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:00,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:00,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:00,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:00,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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:00,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:00,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:50:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:00,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-28 10:50:00,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-28 10:50:00,432 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-28 10:50:12,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:12,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-28 10:50:12,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:12,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:50:12,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:50:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:50:12,068 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-28 10:50:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:13,913 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-28 10:50:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-28 10:50:13,914 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-28 10:50:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:13,914 INFO L225 Difference]: With dead ends: 319 [2019-02-28 10:50:13,915 INFO L226 Difference]: Without dead ends: 213 [2019-02-28 10:50:13,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:50:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-28 10:50:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-28 10:50:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-28 10:50:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-28 10:50:13,920 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-28 10:50:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:13,921 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-28 10:50:13,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:50:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-28 10:50:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-28 10:50:13,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:13,922 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-28 10:50:13,922 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:50:13,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:13,922 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-28 10:50:13,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:13,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:13,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:13,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-28 10:50:18,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:18,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:18,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:18,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:18,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:18,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:18,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:18,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:26,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-28 10:50:26,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:26,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:50:26,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-28 10:50:26,536 INFO L322 TraceCheckSpWp]: Computing backward predicates...