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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:38:42,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:38:42,265 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:38:42,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:38:42,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:38:42,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:38:42,291 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:38:42,293 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:38:42,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:38:42,301 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:38:42,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:38:42,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:38:42,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:38:42,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:38:42,310 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:38:42,311 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:38:42,312 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:38:42,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:38:42,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:38:42,318 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:38:42,319 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:38:42,321 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:38:42,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:38:42,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:38:42,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:38:42,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:38:42,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:38:42,326 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:38:42,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:38:42,329 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:38:42,329 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:38:42,330 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:38:42,330 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:38:42,330 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:38:42,331 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:38:42,332 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:38:42,332 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:38:42,345 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:38:42,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:38:42,347 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:38:42,347 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:38:42,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:38:42,347 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:38:42,348 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:38:42,348 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:38:42,348 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:38:42,348 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:38:42,348 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:38:42,349 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:38:42,349 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:38:42,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:38:42,350 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:38:42,350 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:38:42,350 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:38:42,350 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:38:42,351 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:38:42,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:38:42,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:38:42,351 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:38:42,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:38:42,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:38:42,352 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:38:42,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:38:42,352 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:38:42,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:38:42,353 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:38:42,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:38:42,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:38:42,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:38:42,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:38:42,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:38:42,355 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:38:42,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:38:42,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:38:42,356 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:38:42,356 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:38:42,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:38:42,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:38:42,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:38:42,428 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:38:42,429 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:38:42,430 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-02-28 10:38:42,430 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-28 10:38:42,470 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:38:42,472 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:38:42,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:38:42,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:38:42,473 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:38:42,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:38:42,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:38:42,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:38:42,514 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:38:42,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/1) ... [2019-02-28 10:38:42,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:38:42,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:38:42,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:38:42,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:38:42,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (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:38:42,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-28 10:38:42,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:38:42,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:38:42,951 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:38:42,952 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-28 10:38:42,953 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:38:42 BoogieIcfgContainer [2019-02-28 10:38:42,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:38:42,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:38:42,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:38:42,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:38:42,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:38:42" (1/2) ... [2019-02-28 10:38:42,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3219ee66 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:38:42, skipping insertion in model container [2019-02-28 10:38:42,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:38:42" (2/2) ... [2019-02-28 10:38:42,963 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-28 10:38:42,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:38:42,981 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:38:43,000 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:38:43,034 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:38:43,035 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:38:43,035 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:38:43,035 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:38:43,035 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:38:43,035 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:38:43,035 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:38:43,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:38:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-28 10:38:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:38:43,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:43,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:38:43,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:43,070 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-28 10:38:43,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:43,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:43,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:43,325 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:38:43,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:38:43,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:38:43,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:38:43,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:38:43,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:38:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:38:43,355 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-28 10:38:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:43,547 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-28 10:38:43,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:38:43,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:38:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:43,561 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:38:43,561 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:38:43,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:38:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:38:43,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-28 10:38:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:38:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-28 10:38:43,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-28 10:38:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:43,604 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-28 10:38:43,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:38:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-28 10:38:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:38:43,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:43,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:38:43,605 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:43,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:43,606 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-28 10:38:43,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:43,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:43,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:43,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:38:43,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-28 10:38:43,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:38:43,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:38:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:38:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:38:43,699 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-28 10:38:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:43,765 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-28 10:38:43,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:38:43,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-28 10:38:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:43,769 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:38:43,769 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:38:43,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:38:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:38:43,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-28 10:38:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:38:43,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-28 10:38:43,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-28 10:38:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:43,782 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-28 10:38:43,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:38:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-28 10:38:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:38:43,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:43,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:38:43,783 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-28 10:38:43,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:43,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:43,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-28 10:38:43,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:38:43,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:38:43,846 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:38:43,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:38:43,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:38:43,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:38:43,847 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-28 10:38:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:43,898 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-28 10:38:43,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:38:43,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-28 10:38:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:43,900 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:38:43,900 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:38:43,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:38:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:38:43,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-28 10:38:43,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:38:43,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-28 10:38:43,903 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-28 10:38:43,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:43,904 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-28 10:38:43,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:38:43,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-28 10:38:43,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:38:43,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:43,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:38:43,905 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:43,906 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-28 10:38:43,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:43,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:43,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:43,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:44,348 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-28 10:38:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:44,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:44,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:44,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-28 10:38:44,415 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-28 10:38:44,477 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:38:44,477 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:38:44,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:38:44,676 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:38:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:44,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:38:44,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:44,684 INFO 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:38:44,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:44,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:44,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:38:44,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:44,855 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:44,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-28 10:38:44,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:44,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:38:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:38:44,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:38:44,991 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-28 10:38:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:45,313 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-28 10:38:45,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:38:45,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-28 10:38:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:45,315 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:38:45,315 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:38:45,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-28 10:38:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:38:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-28 10:38:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:38:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-28 10:38:45,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-28 10:38:45,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:45,321 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-28 10:38:45,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:38:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-28 10:38:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-28 10:38:45,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:45,322 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:38:45,323 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:45,323 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-28 10:38:45,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:45,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:45,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:45,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:45,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:45,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:45,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:45,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-28 10:38:45,427 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-28 10:38:45,431 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:38:45,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:38:45,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:38:45,615 INFO L272 AbstractInterpreter]: Visited 12 different actions 96 times. Merged at 11 different actions 70 times. Widened at 3 different actions 7 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-28 10:38:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:45,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:38:45,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:45,616 INFO 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:38:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:45,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:45,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:38:45,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:45,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:45,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:45,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-28 10:38:45,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:45,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:38:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:38:45,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:38:45,805 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-28 10:38:46,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:46,236 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-28 10:38:46,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:38:46,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-28 10:38:46,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:46,238 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:38:46,238 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:38:46,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:38:46,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:38:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-28 10:38:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:38:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-28 10:38:46,244 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-28 10:38:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:46,245 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-28 10:38:46,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:38:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-28 10:38:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:38:46,245 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:46,246 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:38:46,246 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:46,246 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-28 10:38:46,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:46,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:46,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:46,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:46,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:46,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:46,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:46,592 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,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:46,593 INFO 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:38:46,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:46,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:46,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:38:46,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:46,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:38:46,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:46,724 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:46,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:46,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-28 10:38:46,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:46,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:38:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:38:46,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:38:46,799 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-28 10:38:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:47,068 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-28 10:38:47,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:38:47,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-28 10:38:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:47,070 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:38:47,070 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:38:47,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-28 10:38:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:38:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-28 10:38:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:38:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-28 10:38:47,077 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-28 10:38:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:47,078 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-28 10:38:47,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:38:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-28 10:38:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:38:47,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:47,079 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-28 10:38:47,079 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-28 10:38:47,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:47,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:47,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:47,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:47,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:47,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:47,298 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:47,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,298 INFO 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:38:47,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:47,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:47,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:47,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:47,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:38:47,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:47,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:47,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:47,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-28 10:38:47,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:47,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:38:47,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:38:47,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:38:47,447 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-28 10:38:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:47,571 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-28 10:38:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:38:47,572 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-28 10:38:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:47,572 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:38:47,572 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 10:38:47,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:38:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 10:38:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-28 10:38:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:38:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-28 10:38:47,578 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-28 10:38:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:47,578 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-28 10:38:47,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:38:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-28 10:38:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:38:47,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:47,579 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-28 10:38:47,580 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-28 10:38:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:47,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:47,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:47,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:47,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:47,798 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:47,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:47,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:47,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:47,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:47,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:38:47,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:47,920 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:47,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:47,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-28 10:38:47,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:47,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:38:47,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:38:47,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:38:47,978 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-28 10:38:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:48,355 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-28 10:38:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:38:48,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-28 10:38:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:48,359 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:38:48,359 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:38:48,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:38:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:38:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-28 10:38:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:38:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-28 10:38:48,366 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-28 10:38:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:48,366 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-28 10:38:48,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:38:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-28 10:38:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:38:48,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:48,367 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-28 10:38:48,368 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-28 10:38:48,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:48,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:48,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:48,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:48,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:48,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:48,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:48,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:48,581 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:48,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:48,581 INFO 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:38:48,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:48,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:48,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:38:48,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:48,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:38:48,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:48,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:48,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:48,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-28 10:38:48,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:48,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:38:48,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:38:48,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:38:48,777 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-28 10:38:49,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:49,155 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-28 10:38:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:38:49,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-28 10:38:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:49,156 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:38:49,156 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:38:49,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:38:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:38:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-28 10:38:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:38:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-28 10:38:49,162 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-28 10:38:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:49,162 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-28 10:38:49,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:38:49,163 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-28 10:38:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:38:49,163 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:49,164 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-28 10:38:49,164 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-28 10:38:49,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:49,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:49,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:49,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:49,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:49,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:49,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:49,405 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,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:49,405 INFO 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:38:49,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:49,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:49,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:49,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:49,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:38:49,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:49,565 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:49,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:49,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-28 10:38:49,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:49,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:38:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:38:49,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:38:49,628 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-28 10:38:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:50,370 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-28 10:38:50,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:38:50,378 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-28 10:38:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:50,379 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:38:50,379 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:38:50,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:38:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:38:50,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-28 10:38:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:38:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-28 10:38:50,395 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-28 10:38:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:50,395 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-28 10:38:50,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:38:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-28 10:38:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:38:50,397 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:50,397 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-28 10:38:50,397 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-28 10:38:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:50,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:50,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:50,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:50,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:50,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:50,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:50,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:50,933 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:50,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:50,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:50,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:50,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:50,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:38:50,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:51,148 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:51,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:51,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-28 10:38:51,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:51,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:38:51,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:38:51,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:38:51,291 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-28 10:38:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:51,641 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-28 10:38:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:38:51,642 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-28 10:38:51,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:51,642 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:38:51,643 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:38:51,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:38:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:38:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-28 10:38:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:38:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-28 10:38:51,649 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-28 10:38:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:51,650 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-28 10:38:51,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:38:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-28 10:38:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-28 10:38:51,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:51,651 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-28 10:38:51,652 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:51,652 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-28 10:38:51,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:51,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:51,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:51,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:51,933 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:51,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:51,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:51,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:51,934 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:51,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:51,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:51,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:51,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:51,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:38:51,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:51,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:38:51,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:52,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:53,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:53,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-28 10:38:53,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:53,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:38:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:38:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:38:53,290 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-28 10:38:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:55,422 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-28 10:38:55,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:38:55,422 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-28 10:38:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:55,424 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:38:55,424 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:38:55,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:38:55,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:38:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-28 10:38:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:38:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-28 10:38:55,434 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-28 10:38:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:55,435 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-28 10:38:55,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:38:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-28 10:38:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:38:55,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:55,436 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-28 10:38:55,436 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:55,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-28 10:38:55,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:55,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:55,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:55,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:55,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:55,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:55,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:55,869 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:55,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:55,869 INFO 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:38:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:38:55,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:38:55,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:38:55,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:55,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:38:55,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:56,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:56,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:56,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-28 10:38:56,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:56,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:38:56,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:38:56,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:38:56,229 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-28 10:38:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:58,074 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-28 10:38:58,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:38:58,074 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-28 10:38:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:58,076 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:38:58,076 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:38:58,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:38:58,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:38:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-28 10:38:58,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:38:58,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-28 10:38:58,086 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-28 10:38:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:58,087 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-28 10:38:58,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:38:58,087 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-28 10:38:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:38:58,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:58,088 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-28 10:38:58,088 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-28 10:38:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:38:58,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:58,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:58,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:58,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:58,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:38:58,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:58,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:38:58,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:58,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:38:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:58,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:38:58,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:58,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:58,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:58,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-28 10:38:58,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:58,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:38:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:38:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:38:58,615 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-28 10:38:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:38:58,905 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-28 10:38:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:38:58,906 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-28 10:38:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:38:58,908 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:38:58,908 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:38:58,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:38:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:38:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-28 10:38:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:38:58,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-28 10:38:58,918 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-28 10:38:58,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:38:58,918 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-28 10:38:58,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:38:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-28 10:38:58,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:38:58,919 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:38:58,919 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-28 10:38:58,920 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:38:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:38:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-28 10:38:58,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:38:58,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:38:58,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:38:58,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:38:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:38:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:59,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:38:59,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:38:59,458 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,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:38:59,458 INFO 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:38:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:38:59,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:38:59,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:38:59,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:38:59,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:38:59,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:38:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:59,745 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:38:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:38:59,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:38:59,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-28 10:38:59,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:38:59,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:38:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:38:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:38:59,821 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-28 10:39:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:01,093 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-28 10:39:01,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:39:01,093 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-28 10:39:01,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:01,094 INFO L225 Difference]: With dead ends: 109 [2019-02-28 10:39:01,094 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:39:01,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:39:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:39:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-28 10:39:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:39:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-28 10:39:01,105 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-28 10:39:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:01,106 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-28 10:39:01,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:39:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-28 10:39:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:39:01,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:01,107 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-28 10:39:01,107 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-28 10:39:01,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:01,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:01,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:01,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:01,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:01,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:01,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:01,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:39:01,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:01,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:01,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:01,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:01,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:01,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:01,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:39:01,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:01,704 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:01,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:01,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-28 10:39:01,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:01,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:39:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:39:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:39:01,837 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-28 10:39:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:02,152 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-28 10:39:02,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:39:02,153 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-28 10:39:02,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:02,154 INFO L225 Difference]: With dead ends: 120 [2019-02-28 10:39:02,154 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:39:02,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:39:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:39:02,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-28 10:39:02,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:39:02,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-28 10:39:02,166 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-28 10:39:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:02,167 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-28 10:39:02,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:39:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-28 10:39:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:39:02,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:02,168 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-28 10:39:02,168 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-28 10:39:02,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:02,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:02,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:02,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:02,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:02,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:02,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:02,532 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:02,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:02,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:02,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:02,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:02,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:39:02,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:02,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:02,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:02,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-28 10:39:02,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:02,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:39:02,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:39:02,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:39:02,931 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-28 10:39:04,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:04,578 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-28 10:39:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:39:04,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-28 10:39:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:04,581 INFO L225 Difference]: With dead ends: 124 [2019-02-28 10:39:04,581 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:39:04,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-28 10:39:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:39:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-28 10:39:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:39:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-28 10:39:04,607 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-28 10:39:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:04,607 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-28 10:39:04,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:39:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-28 10:39:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:39:04,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:04,613 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-28 10:39:04,614 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:04,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:04,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-28 10:39:04,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:04,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:04,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:04,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:04,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:04,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:04,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:04,902 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:04,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:04,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:04,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:04,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:04,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:39:04,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:04,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:39:04,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:05,272 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:05,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:05,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:05,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-28 10:39:05,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:05,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:39:05,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:39:05,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:39:05,432 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-28 10:39:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:06,056 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-28 10:39:06,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:39:06,057 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-28 10:39:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:06,058 INFO L225 Difference]: With dead ends: 135 [2019-02-28 10:39:06,058 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:39:06,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:39:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:39:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-28 10:39:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:39:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-28 10:39:06,080 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-28 10:39:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:06,085 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-28 10:39:06,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:39:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-28 10:39:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:39:06,087 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:06,087 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-28 10:39:06,087 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-28 10:39:06,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:06,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:06,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:06,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:06,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:06,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:06,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:06,526 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:06,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:06,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:06,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:06,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:06,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:06,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:06,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:39:06,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:06,870 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:06,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:06,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-28 10:39:06,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:06,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:39:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:39:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:39:06,964 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-28 10:39:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:08,899 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-28 10:39:08,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:39:08,900 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-28 10:39:08,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:08,901 INFO L225 Difference]: With dead ends: 139 [2019-02-28 10:39:08,901 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:39:08,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:39:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:39:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-28 10:39:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-28 10:39:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-28 10:39:08,911 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-28 10:39:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:08,911 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-28 10:39:08,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:39:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-28 10:39:08,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-28 10:39:08,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:08,912 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-28 10:39:08,913 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-28 10:39:08,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:08,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:08,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:08,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:08,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:09,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:09,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:09,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:09,448 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:09,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:09,448 INFO 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:39:09,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:09,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:09,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:39:09,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:10,210 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:10,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:10,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-28 10:39:10,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:10,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:39:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:39:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:39:10,387 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-28 10:39:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:10,796 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-28 10:39:10,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:39:10,797 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-28 10:39:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:10,798 INFO L225 Difference]: With dead ends: 150 [2019-02-28 10:39:10,798 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:39:10,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:39:10,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:39:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-28 10:39:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:39:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-28 10:39:10,811 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-28 10:39:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:10,811 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-28 10:39:10,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:39:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-28 10:39:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:39:10,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:10,812 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-28 10:39:10,813 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-28 10:39:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:10,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:11,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:11,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:11,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:11,332 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:11,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:11,332 INFO 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:39:11,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:11,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:11,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:39:11,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:11,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:39:11,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:12,287 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:13,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:13,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-28 10:39:13,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:13,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:39:13,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:39:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:39:13,047 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-28 10:39:15,827 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-28 10:39:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:17,856 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-28 10:39:17,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:39:17,856 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-28 10:39:17,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:17,858 INFO L225 Difference]: With dead ends: 192 [2019-02-28 10:39:17,858 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:39:17,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:39:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:39:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-28 10:39:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:39:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-28 10:39:17,870 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-28 10:39:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:17,871 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-28 10:39:17,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:39:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-28 10:39:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:39:17,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:17,872 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-28 10:39:17,872 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:17,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:17,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-28 10:39:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:17,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:17,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:17,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:18,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:18,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:18,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:18,908 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,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:18,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:18,919 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:18,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:18,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:18,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:18,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:39:18,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:19,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:19,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:19,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-28 10:39:19,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:19,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:39:19,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:39:19,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:39:19,854 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-28 10:39:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:22,118 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-28 10:39:22,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:39:22,123 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-28 10:39:22,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:22,123 INFO L225 Difference]: With dead ends: 169 [2019-02-28 10:39:22,124 INFO L226 Difference]: Without dead ends: 127 [2019-02-28 10:39:22,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:39:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-28 10:39:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-28 10:39:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:39:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-28 10:39:22,135 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-28 10:39:22,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:22,135 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-28 10:39:22,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:39:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-28 10:39:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:39:22,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:22,136 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-28 10:39:22,136 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:22,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:22,137 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-28 10:39:22,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:22,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:22,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:22,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:22,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:22,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:22,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:22,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:22,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:22,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:22,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:22,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:22,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:22,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:39:22,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:23,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:23,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:23,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-28 10:39:23,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:23,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:39:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:39:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:39:23,329 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-28 10:39:23,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:23,877 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-28 10:39:23,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:39:23,877 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-28 10:39:23,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:23,878 INFO L225 Difference]: With dead ends: 180 [2019-02-28 10:39:23,879 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:39:23,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:39:23,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:39:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-28 10:39:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:39:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-28 10:39:23,890 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-28 10:39:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:23,890 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-28 10:39:23,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:39:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-28 10:39:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:39:23,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:23,891 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-28 10:39:23,891 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-28 10:39:23,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:23,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:23,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:24,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:24,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:24,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:24,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:39:24,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:24,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 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:39:24,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:24,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:24,498 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:39:24,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:24,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:39:24,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:25,980 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:25,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:26,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:26,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-28 10:39:26,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:26,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:39:26,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:39:26,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-28 10:39:26,992 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-28 10:39:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:33,518 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-28 10:39:33,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:39:33,518 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-28 10:39:33,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:33,520 INFO L225 Difference]: With dead ends: 230 [2019-02-28 10:39:33,520 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:39:33,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-28 10:39:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:39:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-28 10:39:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-28 10:39:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-28 10:39:33,536 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-28 10:39:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:33,537 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-28 10:39:33,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:39:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-28 10:39:33,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-28 10:39:33,537 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:33,537 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-28 10:39:33,538 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:33,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-28 10:39:33,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:33,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:33,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:33,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:34,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:34,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:34,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:34,168 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:34,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:34,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:34,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:34,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:34,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:34,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:34,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:39:34,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:34,710 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:34,711 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:34,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:34,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-28 10:39:34,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:34,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:39:34,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:39:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:39:34,812 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-28 10:39:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:38,093 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-28 10:39:38,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:39:38,094 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-28 10:39:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:38,096 INFO L225 Difference]: With dead ends: 199 [2019-02-28 10:39:38,096 INFO L226 Difference]: Without dead ends: 149 [2019-02-28 10:39:38,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:39:38,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-28 10:39:38,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-28 10:39:38,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:39:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-28 10:39:38,110 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-28 10:39:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:38,110 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-28 10:39:38,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:39:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-28 10:39:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-28 10:39:38,111 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:38,111 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-28 10:39:38,111 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-28 10:39:38,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:38,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:38,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:38,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:38,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:38,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:38,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:38,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:38,460 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:38,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:38,460 INFO 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:39:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:38,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:38,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:39:38,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:38,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:39,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:39,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-28 10:39:39,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:39,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:39:39,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:39:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:39:39,715 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-28 10:39:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:40,542 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-28 10:39:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:39:40,543 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-28 10:39:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:40,544 INFO L225 Difference]: With dead ends: 210 [2019-02-28 10:39:40,544 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:39:40,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:39:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:39:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-28 10:39:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:39:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-28 10:39:40,562 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-28 10:39:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:40,562 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-28 10:39:40,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:39:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-28 10:39:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:39:40,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:40,563 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-28 10:39:40,563 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-28 10:39:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:40,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:40,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:40,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:41,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:41,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:41,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:41,505 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,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:41,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:41,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:41,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:39:41,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:41,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:39:41,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:42,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:42,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:42,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-28 10:39:42,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:42,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:39:42,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:39:42,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:39:42,379 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-28 10:39:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:46,094 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-28 10:39:46,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:39:46,095 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-28 10:39:46,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:46,096 INFO L225 Difference]: With dead ends: 214 [2019-02-28 10:39:46,096 INFO L226 Difference]: Without dead ends: 160 [2019-02-28 10:39:46,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-28 10:39:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-28 10:39:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-28 10:39:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:39:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-28 10:39:46,117 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-28 10:39:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:46,117 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-28 10:39:46,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:39:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-28 10:39:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:39:46,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:46,118 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-28 10:39:46,118 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-28 10:39:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:46,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:46,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:46,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:46,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:46,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:46,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:39:46,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:46,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:39:46,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:46,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:46,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:46,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:46,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-28 10:39:46,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:47,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:47,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:47,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-28 10:39:47,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:47,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:39:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:39:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:39:47,349 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-28 10:39:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:47,977 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-28 10:39:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:39:47,977 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-28 10:39:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:47,978 INFO L225 Difference]: With dead ends: 225 [2019-02-28 10:39:47,978 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:39:47,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:39:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:39:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-28 10:39:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:39:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-28 10:39:48,000 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-28 10:39:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:48,000 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-28 10:39:48,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:39:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-28 10:39:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:39:48,001 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:48,001 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-28 10:39:48,002 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:48,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-28 10:39:48,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:48,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:48,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:48,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:48,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:49,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:49,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:49,670 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:49,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:49,670 INFO 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:39:49,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:49,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:39:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:49,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:39:49,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:50,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:50,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:50,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-28 10:39:50,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:50,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:39:50,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:39:50,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:39:50,665 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-28 10:39:55,356 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-28 10:39:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:55,688 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-28 10:39:55,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:39:55,688 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-28 10:39:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:55,690 INFO L225 Difference]: With dead ends: 229 [2019-02-28 10:39:55,690 INFO L226 Difference]: Without dead ends: 171 [2019-02-28 10:39:55,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:39:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-28 10:39:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-28 10:39:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:39:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-28 10:39:55,713 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-28 10:39:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:55,714 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-28 10:39:55,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:39:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-28 10:39:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:39:55,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:55,715 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-28 10:39:55,715 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:55,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:55,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-28 10:39:55,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:55,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:55,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:39:55,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:55,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:56,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:56,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:56,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:56,164 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:56,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:56,164 INFO 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:39:56,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:39:56,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:39:56,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:39:56,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:56,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:39:56,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:56,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:57,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:57,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-28 10:39:57,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:57,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:39:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:39:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:39:57,038 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-28 10:39:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:39:57,579 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-28 10:39:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:39:57,580 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-28 10:39:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:39:57,581 INFO L225 Difference]: With dead ends: 240 [2019-02-28 10:39:57,581 INFO L226 Difference]: Without dead ends: 117 [2019-02-28 10:39:57,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:39:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-28 10:39:57,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-28 10:39:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-28 10:39:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-28 10:39:57,597 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-28 10:39:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:39:57,597 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-28 10:39:57,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:39:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-28 10:39:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-28 10:39:57,598 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:39:57,598 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-28 10:39:57,598 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:39:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:39:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-28 10:39:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:39:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:57,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:39:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:39:57,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:39:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:39:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:58,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:58,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:39:58,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:39:58,448 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:58,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:39:58,448 INFO 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:39:58,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:39:58,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:39:58,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:39:58,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:39:58,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:39:58,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:39:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:59,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:39:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:39:59,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:39:59,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-28 10:39:59,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:39:59,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:39:59,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:39:59,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:39:59,629 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-28 10:40:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:05,227 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-28 10:40:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:40:05,235 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-28 10:40:05,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:05,236 INFO L225 Difference]: With dead ends: 244 [2019-02-28 10:40:05,236 INFO L226 Difference]: Without dead ends: 182 [2019-02-28 10:40:05,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-28 10:40:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-28 10:40:05,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-28 10:40:05,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-28 10:40:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-28 10:40:05,263 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-28 10:40:05,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:05,264 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-28 10:40:05,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:40:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-28 10:40:05,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-28 10:40:05,264 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:05,265 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-28 10:40:05,265 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-28 10:40:05,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:05,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:05,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:05,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:05,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:06,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:06,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:06,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:06,282 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:06,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:06,282 INFO 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:40:06,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:06,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:06,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-28 10:40:06,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:06,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:07,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:07,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-28 10:40:07,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:07,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:40:07,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:40:07,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:40:07,255 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-28 10:40:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:08,202 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-28 10:40:08,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:40:08,202 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-28 10:40:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:08,204 INFO L225 Difference]: With dead ends: 255 [2019-02-28 10:40:08,204 INFO L226 Difference]: Without dead ends: 124 [2019-02-28 10:40:08,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:40:08,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-28 10:40:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-28 10:40:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-28 10:40:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-28 10:40:08,225 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-28 10:40:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:08,225 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-28 10:40:08,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:40:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-28 10:40:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-28 10:40:08,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:08,226 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-28 10:40:08,226 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:08,227 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-28 10:40:08,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:08,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:08,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:09,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:09,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:09,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:09,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:40:09,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:09,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:40:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:09,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:09,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:40:09,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:09,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:40:09,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:11,548 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-28 10:40:13,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:13,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:40:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:40:13,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:40:13,380 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-28 10:40:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:24,158 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-28 10:40:24,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-28 10:40:24,158 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-28 10:40:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:24,160 INFO L225 Difference]: With dead ends: 325 [2019-02-28 10:40:24,160 INFO L226 Difference]: Without dead ends: 190 [2019-02-28 10:40:24,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:40:24,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-28 10:40:24,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-28 10:40:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-28 10:40:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-28 10:40:24,183 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-28 10:40:24,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:24,183 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-28 10:40:24,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:40:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-28 10:40:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-28 10:40:24,185 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:24,185 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-28 10:40:24,185 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:24,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-28 10:40:24,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:24,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:24,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:24,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:24,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:25,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:25,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:25,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:25,374 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,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:25,375 INFO 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:40:25,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:25,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:25,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:25,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:25,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:40:25,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:26,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:26,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:26,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:26,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-28 10:40:26,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:26,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:40:26,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:40:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:40:26,736 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-28 10:40:30,670 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-02-28 10:40:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:32,538 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-28 10:40:32,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:40:32,538 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-28 10:40:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:32,540 INFO L225 Difference]: With dead ends: 274 [2019-02-28 10:40:32,541 INFO L226 Difference]: Without dead ends: 204 [2019-02-28 10:40:32,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:40:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-28 10:40:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-28 10:40:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-28 10:40:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-28 10:40:32,566 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-28 10:40:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:32,567 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-28 10:40:32,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:40:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-28 10:40:32,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-28 10:40:32,568 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:32,568 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-28 10:40:32,568 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:32,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:32,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-28 10:40:32,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:32,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:32,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:32,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:33,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:33,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:33,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:33,220 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:33,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:33,220 INFO 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:40:33,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:33,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:40:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:33,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:40:33,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:33,907 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:34,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:34,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-28 10:40:34,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:34,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:40:34,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:40:34,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:40:34,382 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-28 10:40:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:35,342 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-28 10:40:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:40:35,343 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-28 10:40:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:35,344 INFO L225 Difference]: With dead ends: 285 [2019-02-28 10:40:35,344 INFO L226 Difference]: Without dead ends: 138 [2019-02-28 10:40:35,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:40:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-28 10:40:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-28 10:40:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-28 10:40:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-28 10:40:35,369 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-28 10:40:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:35,369 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-28 10:40:35,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:40:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-28 10:40:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-28 10:40:35,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:35,370 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-28 10:40:35,370 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:35,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-28 10:40:35,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:35,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:40:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:35,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:36,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:36,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:36,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:36,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:36,795 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:36,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:36,795 INFO 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:40:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:40:36,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:40:36,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:40:36,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:36,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:40:36,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:39,353 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:41,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:41,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-28 10:40:41,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:41,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:40:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:40:41,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:40:41,958 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-28 10:40:53,160 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-28 10:40:53,462 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-28 10:40:53,781 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-02-28 10:40:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:40:56,145 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-28 10:40:56,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-28 10:40:56,145 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-28 10:40:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:40:56,147 INFO L225 Difference]: With dead ends: 363 [2019-02-28 10:40:56,147 INFO L226 Difference]: Without dead ends: 212 [2019-02-28 10:40:56,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:40:56,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-28 10:40:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-28 10:40:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-28 10:40:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-28 10:40:56,172 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-28 10:40:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:40:56,172 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-28 10:40:56,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:40:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-28 10:40:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-28 10:40:56,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:40:56,173 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-28 10:40:56,174 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:40:56,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:40:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-28 10:40:56,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:40:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:56,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:40:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:40:56,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:40:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:40:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:57,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:57,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:40:57,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:40:57,634 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:57,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:40:57,634 INFO 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:40:57,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:40:57,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:40:57,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:40:57,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:40:57,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:40:57,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:40:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:58,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:40:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:40:59,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:40:59,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-28 10:40:59,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:40:59,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:40:59,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:40:59,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:40:59,009 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-28 10:41:03,554 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-28 10:41:03,854 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-28 10:41:04,121 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-28 10:41:04,300 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:41:06,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:06,052 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-28 10:41:06,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:41:06,052 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-28 10:41:06,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:06,054 INFO L225 Difference]: With dead ends: 304 [2019-02-28 10:41:06,054 INFO L226 Difference]: Without dead ends: 226 [2019-02-28 10:41:06,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-28 10:41:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-28 10:41:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-28 10:41:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-28 10:41:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-28 10:41:06,089 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-28 10:41:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:06,090 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-28 10:41:06,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:41:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-28 10:41:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-28 10:41:06,091 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:06,091 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-28 10:41:06,091 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:06,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:06,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-28 10:41:06,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:06,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:06,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:06,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:06,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:06,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:06,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:06,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:06,859 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:06,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:06,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:41:06,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:06,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:06,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:41:06,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:07,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:08,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:08,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-28 10:41:08,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:08,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:41:08,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:41:08,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:41:08,531 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-28 10:41:09,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:09,922 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-28 10:41:09,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:41:09,923 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-28 10:41:09,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:09,924 INFO L225 Difference]: With dead ends: 315 [2019-02-28 10:41:09,924 INFO L226 Difference]: Without dead ends: 152 [2019-02-28 10:41:09,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:41:09,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-28 10:41:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-28 10:41:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-28 10:41:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-28 10:41:09,963 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-28 10:41:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:09,963 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-28 10:41:09,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:41:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-28 10:41:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-28 10:41:09,964 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:09,964 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-28 10:41:09,964 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:09,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-28 10:41:09,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:09,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:09,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:11,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:11,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:11,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:11,927 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:11,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:11,927 INFO 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:41:11,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:11,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:11,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:41:11,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:11,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:41:11,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:15,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:15,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:18,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:18,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-28 10:41:18,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:18,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:41:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:41:18,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:41:18,212 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-28 10:41:30,386 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-28 10:41:30,705 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-28 10:41:31,028 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-28 10:41:31,305 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:41:31,573 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:41:32,308 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-28 10:41:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:34,170 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-28 10:41:34,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-28 10:41:34,171 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-28 10:41:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:34,172 INFO L225 Difference]: With dead ends: 401 [2019-02-28 10:41:34,172 INFO L226 Difference]: Without dead ends: 234 [2019-02-28 10:41:34,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-28 10:41:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-28 10:41:34,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-28 10:41:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-28 10:41:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-28 10:41:34,201 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-28 10:41:34,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:34,201 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-28 10:41:34,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:41:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-28 10:41:34,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-28 10:41:34,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:34,203 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-28 10:41:34,203 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:34,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:34,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-28 10:41:34,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:34,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:34,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:34,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:34,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:36,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:36,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:36,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:36,174 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:36,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:36,175 INFO 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:41:36,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:41:36,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:41:36,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:41:36,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:36,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:41:36,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:38,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:38,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:38,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-28 10:41:38,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:38,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:41:38,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:41:38,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:41:38,282 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-28 10:41:44,281 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-28 10:41:44,605 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-28 10:41:44,919 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-28 10:41:45,126 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:41:45,320 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:41:45,515 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:41:45,894 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-28 10:41:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:47,410 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-28 10:41:47,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:41:47,410 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-28 10:41:47,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:47,412 INFO L225 Difference]: With dead ends: 334 [2019-02-28 10:41:47,413 INFO L226 Difference]: Without dead ends: 248 [2019-02-28 10:41:47,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-28 10:41:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-28 10:41:47,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-28 10:41:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-28 10:41:47,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-28 10:41:47,453 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-28 10:41:47,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:47,454 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-28 10:41:47,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:41:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-28 10:41:47,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-28 10:41:47,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:47,455 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-28 10:41:47,455 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:47,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:47,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-28 10:41:47,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:47,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:41:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:47,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:49,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:49,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:49,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:49,189 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:49,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:49,189 INFO 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:41:49,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:49,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:41:49,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:49,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:41:49,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:50,143 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:50,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:50,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-28 10:41:50,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:50,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:41:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:41:50,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:41:50,849 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-28 10:41:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:52,513 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-28 10:41:52,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:41:52,515 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-28 10:41:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:52,517 INFO L225 Difference]: With dead ends: 345 [2019-02-28 10:41:52,517 INFO L226 Difference]: Without dead ends: 166 [2019-02-28 10:41:52,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:41:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-28 10:41:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-28 10:41:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-28 10:41:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-28 10:41:52,546 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-28 10:41:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:52,546 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-28 10:41:52,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:41:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-28 10:41:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-28 10:41:52,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:52,547 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-28 10:41:52,547 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:41:52,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:52,547 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-28 10:41:52,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:52,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:52,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:54,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:54,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:54,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:54,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:41:54,474 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:54,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:54,474 INFO 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:41:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:41:54,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:41:54,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:41:54,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:41:54,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:41:54,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:41:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:56,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:41:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:56,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:41:56,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-28 10:41:56,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:41:56,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:41:56,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:41:56,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:41:56,213 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-28 10:42:03,480 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-28 10:42:03,900 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-28 10:42:04,232 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-28 10:42:04,447 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:42:04,677 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:42:04,908 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:42:05,104 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:42:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:07,074 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-28 10:42:07,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:42:07,074 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-28 10:42:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:07,076 INFO L225 Difference]: With dead ends: 349 [2019-02-28 10:42:07,076 INFO L226 Difference]: Without dead ends: 259 [2019-02-28 10:42:07,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:42:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-28 10:42:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-28 10:42:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-28 10:42:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-28 10:42:07,109 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-28 10:42:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:07,110 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-28 10:42:07,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:42:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-28 10:42:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-28 10:42:07,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:07,111 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-28 10:42:07,111 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:07,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-28 10:42:07,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:07,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:07,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:07,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:08,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:08,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:08,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:08,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:08,045 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:08,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:08,045 INFO 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:42:08,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:08,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:08,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:08,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:08,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:42:08,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:09,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:10,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:10,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-28 10:42:10,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:10,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:42:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:42:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:42:10,150 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-28 10:42:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:12,023 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-28 10:42:12,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:42:12,024 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-28 10:42:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:12,025 INFO L225 Difference]: With dead ends: 360 [2019-02-28 10:42:12,025 INFO L226 Difference]: Without dead ends: 173 [2019-02-28 10:42:12,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:42:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-28 10:42:12,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-28 10:42:12,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-28 10:42:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-28 10:42:12,055 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-28 10:42:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:12,056 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-28 10:42:12,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:42:12,056 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-28 10:42:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-28 10:42:12,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:12,057 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-28 10:42:12,057 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:12,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-28 10:42:12,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:12,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:12,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:12,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:13,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:13,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:13,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:13,970 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:13,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:13,970 INFO 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:42:13,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:13,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:14,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:42:14,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:15,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:16,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:16,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-28 10:42:16,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:16,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:42:16,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:42:16,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:42:16,058 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-28 10:42:23,850 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-28 10:42:24,336 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-28 10:42:24,691 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-28 10:42:24,932 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:42:25,179 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:42:25,401 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:42:25,611 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:42:25,817 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:42:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:27,896 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-28 10:42:27,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:42:27,897 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-28 10:42:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:27,898 INFO L225 Difference]: With dead ends: 364 [2019-02-28 10:42:27,898 INFO L226 Difference]: Without dead ends: 270 [2019-02-28 10:42:27,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:42:27,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-28 10:42:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-28 10:42:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-28 10:42:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-28 10:42:27,931 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-28 10:42:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:27,932 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-28 10:42:27,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:42:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-28 10:42:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-28 10:42:27,932 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:27,933 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-28 10:42:27,933 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:27,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:27,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-28 10:42:27,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:27,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:27,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:30,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:30,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:30,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:30,017 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:30,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:30,018 INFO 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:42:30,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:30,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:30,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:42:30,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:30,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:42:30,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:31,591 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:32,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:32,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-28 10:42:32,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:32,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:42:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:42:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:42:32,432 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-28 10:42:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:34,545 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-28 10:42:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:42:34,545 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-28 10:42:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:34,546 INFO L225 Difference]: With dead ends: 375 [2019-02-28 10:42:34,546 INFO L226 Difference]: Without dead ends: 180 [2019-02-28 10:42:34,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:42:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-28 10:42:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-28 10:42:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-28 10:42:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-28 10:42:34,578 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-28 10:42:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:34,578 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-28 10:42:34,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:42:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-28 10:42:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-28 10:42:34,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:34,579 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-28 10:42:34,580 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-28 10:42:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:34,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:34,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:34,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:36,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:36,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:36,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:36,627 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:36,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:36,627 INFO 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:42:36,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:36,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:36,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:36,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:36,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:42:36,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:38,365 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:38,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:38,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:38,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-28 10:42:38,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:38,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:42:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:42:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:42:38,554 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-28 10:42:45,370 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-28 10:42:45,757 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-28 10:42:46,130 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-28 10:42:46,385 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:42:46,633 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:42:46,865 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:42:47,094 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:42:47,315 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:42:47,521 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:42:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:49,851 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-28 10:42:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:42:49,851 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-28 10:42:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:49,853 INFO L225 Difference]: With dead ends: 379 [2019-02-28 10:42:49,853 INFO L226 Difference]: Without dead ends: 281 [2019-02-28 10:42:49,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:42:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-28 10:42:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-28 10:42:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-28 10:42:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-28 10:42:49,900 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-28 10:42:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:49,901 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-28 10:42:49,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:42:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-28 10:42:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-28 10:42:49,902 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:49,902 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-28 10:42:49,902 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-28 10:42:49,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:49,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:49,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:49,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:51,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:51,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:51,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:51,717 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:51,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:51,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:42:51,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:51,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:51,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:42:51,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:52,916 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:53,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:53,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-28 10:42:53,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:53,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:42:53,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:42:53,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:42:53,796 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-28 10:42:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:56,075 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-28 10:42:56,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:42:56,075 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-28 10:42:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:56,076 INFO L225 Difference]: With dead ends: 390 [2019-02-28 10:42:56,076 INFO L226 Difference]: Without dead ends: 187 [2019-02-28 10:42:56,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:42:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-28 10:42:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-28 10:42:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-28 10:42:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-28 10:42:56,128 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-28 10:42:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:56,129 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-28 10:42:56,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:42:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-28 10:42:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-28 10:42:56,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:56,130 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-28 10:42:56,131 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:42:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:56,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-28 10:42:56,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:56,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:56,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:56,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:58,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:58,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:58,651 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:58,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:58,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:42:58,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:58,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:58,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:42:58,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:58,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:42:58,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:03,494 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:07,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:07,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:07,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-28 10:43:07,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:07,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-28 10:43:07,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-28 10:43:07,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-28 10:43:07,679 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-28 10:43:25,940 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-28 10:43:26,393 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-28 10:43:26,874 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-28 10:43:27,277 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:43:27,653 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:43:28,005 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:43:28,359 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:43:28,691 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:43:29,014 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:43:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:32,362 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-28 10:43:32,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-28 10:43:32,362 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-28 10:43:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:32,363 INFO L225 Difference]: With dead ends: 496 [2019-02-28 10:43:32,364 INFO L226 Difference]: Without dead ends: 289 [2019-02-28 10:43:32,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-28 10:43:32,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-28 10:43:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-28 10:43:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-28 10:43:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-28 10:43:32,404 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-28 10:43:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:32,404 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-28 10:43:32,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-28 10:43:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-28 10:43:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-28 10:43:32,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:32,405 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-28 10:43:32,405 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-28 10:43:32,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:32,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:32,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:32,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:34,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:34,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:34,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:34,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:34,240 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:34,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:34,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 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:43:34,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:34,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:34,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:34,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:34,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-28 10:43:34,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:36,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:37,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:37,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-28 10:43:37,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:37,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:43:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:43:37,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:43:37,136 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-28 10:43:45,758 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-28 10:43:46,314 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-28 10:43:46,713 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-28 10:43:46,993 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:43:47,265 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:43:47,524 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:43:47,775 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:43:48,014 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:43:48,249 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:43:48,489 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:43:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:50,941 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-28 10:43:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-28 10:43:50,945 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-28 10:43:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:50,947 INFO L225 Difference]: With dead ends: 409 [2019-02-28 10:43:50,947 INFO L226 Difference]: Without dead ends: 303 [2019-02-28 10:43:50,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:43:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-28 10:43:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-28 10:43:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-28 10:43:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-28 10:43:50,985 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-28 10:43:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:50,986 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-28 10:43:50,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:43:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-28 10:43:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-28 10:43:50,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:50,987 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-28 10:43:50,987 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-28 10:43:50,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:50,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:50,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:52,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:52,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:52,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:52,207 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:52,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:52,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:43:52,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:52,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:52,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:43:52,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:55,832 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:57,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:57,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-28 10:43:57,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:57,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:43:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:43:57,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:43:57,087 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-28 10:43:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:59,487 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-28 10:43:59,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:43:59,488 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-28 10:43:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:59,489 INFO L225 Difference]: With dead ends: 420 [2019-02-28 10:43:59,489 INFO L226 Difference]: Without dead ends: 201 [2019-02-28 10:43:59,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:43:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-28 10:43:59,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-28 10:43:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-28 10:43:59,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-28 10:43:59,527 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-28 10:43:59,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:59,527 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-28 10:43:59,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:43:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-28 10:43:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-28 10:43:59,528 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:59,528 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-28 10:43:59,529 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:43:59,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:59,529 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-28 10:43:59,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:59,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:59,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:59,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:59,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:01,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:01,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:01,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:01,664 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:01,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:01,664 INFO 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:44:01,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:01,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:01,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-28 10:44:01,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:01,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:44:01,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:03,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:03,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:03,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:03,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-28 10:44:03,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:03,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:44:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:44:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:44:03,941 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-28 10:44:12,719 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-28 10:44:13,148 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-28 10:44:13,566 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-28 10:44:13,872 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:44:14,146 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:44:14,423 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:44:14,689 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:44:14,942 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:44:15,185 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:44:15,420 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:44:15,652 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:44:16,508 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-28 10:44:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:18,280 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-28 10:44:18,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-28 10:44:18,281 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-28 10:44:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:18,283 INFO L225 Difference]: With dead ends: 424 [2019-02-28 10:44:18,284 INFO L226 Difference]: Without dead ends: 314 [2019-02-28 10:44:18,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-28 10:44:18,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-28 10:44:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-28 10:44:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-28 10:44:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-28 10:44:18,335 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-28 10:44:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:18,335 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-28 10:44:18,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:44:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-28 10:44:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-28 10:44:18,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:18,337 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-28 10:44:18,337 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:18,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-28 10:44:18,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:18,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:18,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:19,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:19,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:19,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:19,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:19,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:19,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:19,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:19,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:19,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:19,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:19,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-28 10:44:19,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:20,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:22,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:22,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-28 10:44:22,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:22,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:44:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:44:22,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:44:22,293 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-28 10:44:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:24,798 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-28 10:44:24,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:44:24,799 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-28 10:44:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:24,801 INFO L225 Difference]: With dead ends: 435 [2019-02-28 10:44:24,801 INFO L226 Difference]: Without dead ends: 208 [2019-02-28 10:44:24,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:44:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-28 10:44:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-28 10:44:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-28 10:44:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-28 10:44:24,852 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-28 10:44:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:24,852 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-28 10:44:24,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:44:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-28 10:44:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-28 10:44:24,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:24,854 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-28 10:44:24,854 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-28 10:44:24,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:24,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:24,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:24,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:24,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:27,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:27,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:27,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:27,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:27,269 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,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:27,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:44:27,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:27,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:27,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-28 10:44:27,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:29,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:29,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:29,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-28 10:44:29,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:29,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:44:29,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:44:29,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:44:29,687 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-28 10:44:39,067 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-28 10:44:39,534 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-28 10:44:39,968 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-28 10:44:40,281 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:44:40,586 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:44:40,874 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:44:41,161 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:44:41,438 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:44:41,715 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:44:41,962 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:44:42,255 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:44:42,511 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:44:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:45,025 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-28 10:44:45,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-28 10:44:45,025 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-28 10:44:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:45,027 INFO L225 Difference]: With dead ends: 439 [2019-02-28 10:44:45,028 INFO L226 Difference]: Without dead ends: 325 [2019-02-28 10:44:45,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:44:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-28 10:44:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-28 10:44:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-28 10:44:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-28 10:44:45,083 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-28 10:44:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:45,084 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-28 10:44:45,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:44:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-28 10:44:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-28 10:44:45,085 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:45,085 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-28 10:44:45,085 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-28 10:44:45,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:45,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:45,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:45,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:45,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:46,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:46,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:46,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:46,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:46,333 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:46,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:46,333 INFO 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:44:46,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:46,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:46,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:44:46,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:46,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:44:46,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:48,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:49,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:49,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-28 10:44:49,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:49,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:44:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:44:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:44:49,376 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-28 10:44:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:52,105 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-28 10:44:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:44:52,106 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-28 10:44:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:52,108 INFO L225 Difference]: With dead ends: 450 [2019-02-28 10:44:52,108 INFO L226 Difference]: Without dead ends: 215 [2019-02-28 10:44:52,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:44:52,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-28 10:44:52,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-28 10:44:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-28 10:44:52,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-28 10:44:52,178 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-28 10:44:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:52,178 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-28 10:44:52,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:44:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-28 10:44:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-28 10:44:52,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:52,180 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-28 10:44:52,180 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:44:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:52,181 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-28 10:44:52,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:52,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:52,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:52,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:52,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:54,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:54,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:54,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:54,618 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:54,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:54,619 INFO 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:44:54,629 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:54,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:54,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:54,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:54,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-02-28 10:44:54,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:57,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:57,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:57,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-28 10:44:57,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:57,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:44:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:44:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:44:57,895 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-28 10:45:08,626 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-28 10:45:09,104 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-28 10:45:09,578 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-28 10:45:09,903 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:45:10,218 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:45:10,540 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:45:10,841 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:45:11,138 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:45:11,418 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:45:11,687 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:45:11,960 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:45:12,212 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:45:12,453 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:45:12,946 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-28 10:45:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:15,096 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-28 10:45:15,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-28 10:45:15,097 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-28 10:45:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:15,099 INFO L225 Difference]: With dead ends: 454 [2019-02-28 10:45:15,100 INFO L226 Difference]: Without dead ends: 336 [2019-02-28 10:45:15,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-28 10:45:15,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-28 10:45:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-28 10:45:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-28 10:45:15,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-28 10:45:15,166 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-28 10:45:15,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:15,167 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-28 10:45:15,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:45:15,167 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-28 10:45:15,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-28 10:45:15,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:15,168 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-28 10:45:15,168 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:15,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:15,168 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-28 10:45:15,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:15,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:15,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:15,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:15,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:16,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:16,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:16,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:16,435 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:16,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:16,436 INFO 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:45:16,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:16,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:16,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:45:16,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:18,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:18,281 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:19,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:19,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-28 10:45:19,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:19,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:45:19,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:45:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:45:19,458 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-28 10:45:22,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:22,291 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-28 10:45:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:45:22,291 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-28 10:45:22,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:22,292 INFO L225 Difference]: With dead ends: 465 [2019-02-28 10:45:22,293 INFO L226 Difference]: Without dead ends: 222 [2019-02-28 10:45:22,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:45:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-28 10:45:22,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-28 10:45:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-28 10:45:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-28 10:45:22,338 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-28 10:45:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:22,338 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-28 10:45:22,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:45:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-28 10:45:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-28 10:45:22,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:22,339 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-28 10:45:22,339 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:45:22,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:22,339 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-28 10:45:22,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:22,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:22,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:22,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:22,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:24,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:24,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:24,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:24,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:24,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:24,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:24,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:45:24,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:24,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:24,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-28 10:45:24,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:24,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:45:24,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:31,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:36,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:36,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-28 10:45:36,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:36,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-28 10:45:36,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-28 10:45:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:45:36,864 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-28 10:46:01,997 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-28 10:46:02,584 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-28 10:46:03,226 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-28 10:46:03,741 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:46:04,288 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:46:04,786 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:46:05,264 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:46:05,749 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:46:06,196 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:46:06,627 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:46:07,040 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:46:07,431 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:46:07,816 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:46:08,175 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:46:09,245 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-28 10:46:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:11,957 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-28 10:46:11,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-28 10:46:11,957 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-28 10:46:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:11,959 INFO L225 Difference]: With dead ends: 591 [2019-02-28 10:46:11,959 INFO L226 Difference]: Without dead ends: 344 [2019-02-28 10:46:11,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-28 10:46:11,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-28 10:46:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-28 10:46:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-28 10:46:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-28 10:46:12,010 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-28 10:46:12,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:12,010 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-28 10:46:12,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-28 10:46:12,010 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-28 10:46:12,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-28 10:46:12,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:12,011 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-28 10:46:12,012 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:12,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:12,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-28 10:46:12,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:12,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:12,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:12,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:12,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:14,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:14,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:14,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:14,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:14,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:46:14,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:14,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 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:46:14,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:14,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:14,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:14,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:14,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 131 conjunts are in the unsatisfiable core [2019-02-28 10:46:14,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:17,359 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:17,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:17,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-28 10:46:17,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:17,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:46:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:46:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:46:17,604 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-28 10:46:30,945 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-28 10:46:31,467 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-28 10:46:31,994 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-28 10:46:32,342 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:46:32,695 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:46:33,031 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:46:33,357 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:46:33,683 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:46:33,999 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:46:34,307 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:46:34,596 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:46:34,931 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:46:35,213 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:46:35,482 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:46:35,771 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:46:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:38,531 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-28 10:46:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-28 10:46:38,531 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-28 10:46:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:38,533 INFO L225 Difference]: With dead ends: 484 [2019-02-28 10:46:38,533 INFO L226 Difference]: Without dead ends: 358 [2019-02-28 10:46:38,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:46:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-28 10:46:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-28 10:46:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-28 10:46:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-28 10:46:38,588 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-28 10:46:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:38,588 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-28 10:46:38,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:46:38,588 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-28 10:46:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-28 10:46:38,590 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:38,590 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-28 10:46:38,590 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:38,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-28 10:46:38,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:38,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:38,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:38,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:40,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:40,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:40,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:40,425 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:40,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:40,425 INFO 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:46:40,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:40,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:40,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:46:40,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:42,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:43,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:43,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-28 10:46:43,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:43,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:46:43,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:46:43,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:46:43,870 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-28 10:46:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:46,479 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-28 10:46:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:46:46,479 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-28 10:46:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:46,480 INFO L225 Difference]: With dead ends: 495 [2019-02-28 10:46:46,480 INFO L226 Difference]: Without dead ends: 236 [2019-02-28 10:46:46,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:46:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-28 10:46:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-28 10:46:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-28 10:46:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-28 10:46:46,536 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-28 10:46:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:46,537 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-28 10:46:46,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:46:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-28 10:46:46,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-28 10:46:46,538 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:46,538 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-28 10:46:46,538 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:46:46,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:46,539 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-28 10:46:46,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:46,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:46,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:46,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:49,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:49,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:49,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:49,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:49,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:49,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:46:49,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:49,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:49,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-28 10:46:49,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:49,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:46:49,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:56,254 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:02,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:02,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-28 10:47:02,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:02,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-28 10:47:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-28 10:47:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:47:02,621 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-28 10:47:28,943 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-28 10:47:29,570 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-28 10:47:30,217 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-28 10:47:30,783 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:47:31,376 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:47:31,930 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:47:32,446 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:47:32,992 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:47:33,492 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:47:33,972 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:47:34,436 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:47:34,883 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:47:35,316 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:47:35,730 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:47:36,134 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:47:36,567 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:47:36,934 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:47:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:40,478 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-28 10:47:40,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-28 10:47:40,479 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-28 10:47:40,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:40,481 INFO L225 Difference]: With dead ends: 629 [2019-02-28 10:47:40,481 INFO L226 Difference]: Without dead ends: 366 [2019-02-28 10:47:40,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 44.9s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-28 10:47:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-28 10:47:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-28 10:47:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-28 10:47:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-28 10:47:40,538 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-28 10:47:40,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:40,538 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-28 10:47:40,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-28 10:47:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-28 10:47:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-28 10:47:40,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:40,539 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-28 10:47:40,540 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:47:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:40,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-28 10:47:40,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:40,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:40,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:43,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:43,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:43,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:43,542 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:43,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:43,542 INFO 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:47:43,552 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:43,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:43,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:43,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:43,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-28 10:47:43,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:46,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:46,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:46,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-28 10:47:46,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:46,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:47:46,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:47:46,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:47:46,900 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-28 10:47:59,225 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-28 10:47:59,787 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-28 10:48:00,328 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-28 10:48:00,728 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:48:01,104 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:48:01,479 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:48:01,882 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:48:02,258 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:48:02,607 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:48:02,943 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:48:03,270 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:48:03,589 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:48:03,887 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:48:04,187 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:48:04,473 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:48:04,759 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:48:05,041 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:48:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:08,051 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-28 10:48:08,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-28 10:48:08,052 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-28 10:48:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:08,054 INFO L225 Difference]: With dead ends: 514 [2019-02-28 10:48:08,054 INFO L226 Difference]: Without dead ends: 380 [2019-02-28 10:48:08,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:48:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-28 10:48:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-28 10:48:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-28 10:48:08,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-28 10:48:08,113 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-28 10:48:08,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:08,113 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-28 10:48:08,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:48:08,113 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-28 10:48:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-28 10:48:08,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:08,114 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-28 10:48:08,114 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:08,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:08,114 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-28 10:48:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:08,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:08,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:08,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:08,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:09,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:09,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:09,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:09,733 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:09,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:09,734 INFO 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:48:09,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:09,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:09,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:48:09,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:11,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:13,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:13,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-28 10:48:13,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:13,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:48:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:48:13,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:48:13,463 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-28 10:48:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:16,107 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-28 10:48:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:48:16,107 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-28 10:48:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:16,109 INFO L225 Difference]: With dead ends: 525 [2019-02-28 10:48:16,109 INFO L226 Difference]: Without dead ends: 250 [2019-02-28 10:48:16,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:48:16,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-28 10:48:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-28 10:48:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-28 10:48:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-28 10:48:16,175 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-28 10:48:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:16,175 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-28 10:48:16,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:48:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-28 10:48:16,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-28 10:48:16,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:16,176 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-28 10:48:16,177 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:48:16,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:16,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-28 10:48:16,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:16,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:16,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:16,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:19,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:19,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:19,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:19,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:19,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:19,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:19,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:48:19,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:19,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:19,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:48:19,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:19,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:48:19,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:26,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:34,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:34,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-28 10:48:34,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:34,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-28 10:48:34,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-28 10:48:34,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:48:34,290 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-28 10:49:02,754 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-28 10:49:03,481 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-28 10:49:04,161 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-28 10:49:04,805 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:49:05,457 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:49:06,046 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:49:06,616 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:49:07,173 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:49:07,723 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:49:08,265 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:49:08,797 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:49:09,304 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:49:09,810 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:49:10,300 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:49:10,769 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:49:11,196 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:49:11,620 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:49:12,021 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:49:13,548 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-28 10:49:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:16,221 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-28 10:49:16,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-28 10:49:16,221 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-28 10:49:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:16,224 INFO L225 Difference]: With dead ends: 667 [2019-02-28 10:49:16,224 INFO L226 Difference]: Without dead ends: 388 [2019-02-28 10:49:16,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 50.4s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-28 10:49:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-28 10:49:16,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-28 10:49:16,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-28 10:49:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-28 10:49:16,291 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-28 10:49:16,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:16,291 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-28 10:49:16,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-28 10:49:16,291 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-28 10:49:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-28 10:49:16,292 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:16,293 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-28 10:49:16,293 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:16,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:16,293 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-28 10:49:16,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:16,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:16,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:19,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:19,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:19,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:19,394 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:19,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:19,394 INFO 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:49:19,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:19,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:19,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:19,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:19,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 147 conjunts are in the unsatisfiable core [2019-02-28 10:49:19,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:22,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:22,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:22,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:22,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:22,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-28 10:49:22,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:22,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:49:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:49:22,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:49:22,917 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-28 10:49:37,424 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-28 10:49:38,022 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-28 10:49:38,618 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-28 10:49:39,059 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-28 10:49:39,500 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:49:39,899 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:49:40,300 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:49:40,696 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:49:41,069 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:49:41,435 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:49:41,803 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:49:42,153 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:49:42,484 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:49:42,820 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:49:43,148 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:49:43,467 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:49:43,758 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:49:44,044 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:49:44,375 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:49:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:47,431 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-28 10:49:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-28 10:49:47,431 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-28 10:49:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:47,433 INFO L225 Difference]: With dead ends: 544 [2019-02-28 10:49:47,433 INFO L226 Difference]: Without dead ends: 402 [2019-02-28 10:49:47,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:49:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-28 10:49:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-28 10:49:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-28 10:49:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-28 10:49:47,498 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-28 10:49:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:47,498 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-28 10:49:47,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:49:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-28 10:49:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-28 10:49:47,499 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:47,500 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-28 10:49:47,500 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:47,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-28 10:49:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:47,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:47,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:49,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:49,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:49,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:49,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:49:49,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:49,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 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:49:49,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:49,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:49,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:49:49,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:51,694 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:53,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:53,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-28 10:49:53,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:53,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:49:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:49:53,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:49:53,385 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-28 10:49:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:56,518 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-28 10:49:56,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:49:56,518 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-28 10:49:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:56,519 INFO L225 Difference]: With dead ends: 555 [2019-02-28 10:49:56,520 INFO L226 Difference]: Without dead ends: 264 [2019-02-28 10:49:56,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:49:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-28 10:49:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-28 10:49:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-28 10:49:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-28 10:49:56,585 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-28 10:49:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:56,585 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-28 10:49:56,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:49:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-28 10:49:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-28 10:49:56,586 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:56,586 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-28 10:49:56,587 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:49:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-28 10:49:56,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:56,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:56,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:00,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:00,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:00,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:00,073 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,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:00,073 INFO 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:50:00,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:00,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:00,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-28 10:50:00,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:00,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:50:00,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:08,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:16,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:16,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-28 10:50:16,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:16,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-28 10:50:16,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-28 10:50:16,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:50:16,760 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-28 10:50:48,898 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-28 10:50:49,651 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-28 10:50:50,441 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-28 10:50:51,165 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-28 10:50:51,847 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-28 10:50:52,540 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:50:53,177 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:50:53,794 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:50:54,400 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:50:54,968 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:50:55,541 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:50:56,160 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:50:56,708 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:50:57,236 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:50:57,754 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:50:58,247 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:50:58,732 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:50:59,184 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:50:59,624 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:51:00,045 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:51:00,453 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:51:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:04,399 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-28 10:51:04,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-28 10:51:04,400 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-28 10:51:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:04,402 INFO L225 Difference]: With dead ends: 705 [2019-02-28 10:51:04,403 INFO L226 Difference]: Without dead ends: 410 [2019-02-28 10:51:04,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-28 10:51:04,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-28 10:51:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-28 10:51:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-28 10:51:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-28 10:51:04,478 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-28 10:51:04,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:04,478 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-28 10:51:04,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-28 10:51:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-28 10:51:04,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-28 10:51:04,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:04,480 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-28 10:51:04,480 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:04,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-28 10:51:04,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:04,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:04,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:07,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:07,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:07,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:07,937 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:51:07,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:07,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:07,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:51:07,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:51:07,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:51:07,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:07,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-02-28 10:51:08,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:11,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:11,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:11,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-28 10:51:11,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:11,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-28 10:51:11,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-28 10:51:11,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:51:11,930 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-28 10:51:28,704 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-28 10:51:29,364 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-28 10:51:30,002 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-28 10:51:30,462 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-28 10:51:30,917 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-28 10:51:31,353 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-28 10:51:31,811 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-28 10:51:32,260 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-28 10:51:32,682 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-28 10:51:33,091 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-28 10:51:33,481 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-28 10:51:33,868 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-28 10:51:34,239 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-28 10:51:34,607 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-28 10:51:34,956 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-28 10:51:35,292 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-28 10:51:35,636 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-28 10:51:35,964 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-28 10:51:36,272 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-28 10:51:36,573 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-28 10:51:36,895 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-28 10:51:37,235 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-28 10:51:40,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:40,112 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-02-28 10:51:40,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-02-28 10:51:40,112 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-02-28 10:51:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:40,114 INFO L225 Difference]: With dead ends: 574 [2019-02-28 10:51:40,114 INFO L226 Difference]: Without dead ends: 424 [2019-02-28 10:51:40,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-02-28 10:51:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-28 10:51:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-02-28 10:51:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-28 10:51:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-02-28 10:51:40,200 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-02-28 10:51:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:40,200 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-02-28 10:51:40,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-28 10:51:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-02-28 10:51:40,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-28 10:51:40,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:40,202 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-28 10:51:40,202 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:40,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:40,202 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-02-28 10:51:40,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:40,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:40,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:40,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat