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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:57:29,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:57:29,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:57:29,350 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:57:29,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:57:29,351 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:57:29,353 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:57:29,354 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:57:29,356 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:57:29,357 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:57:29,358 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:57:29,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:57:29,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:57:29,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:57:29,361 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:57:29,362 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:57:29,363 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:57:29,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:57:29,370 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:57:29,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:57:29,375 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:57:29,379 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:57:29,385 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:57:29,385 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:57:29,385 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:57:29,386 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:57:29,387 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:57:29,388 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:57:29,392 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:57:29,394 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:57:29,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:57:29,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:57:29,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:57:29,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:57:29,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:57:29,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:57:29,399 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:57:29,423 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:57:29,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:57:29,424 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:57:29,425 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:57:29,425 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:57:29,425 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:57:29,425 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:57:29,425 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:57:29,426 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:57:29,426 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:57:29,426 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:57:29,426 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:57:29,426 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:57:29,427 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:57:29,427 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:57:29,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:57:29,428 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:57:29,428 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:57:29,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:57:29,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:57:29,429 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:57:29,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:57:29,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:57:29,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:57:29,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:57:29,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:57:29,432 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:57:29,432 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:57:29,432 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:57:29,432 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:57:29,433 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:57:29,434 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:57:29,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:57:29,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:57:29,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:57:29,435 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:57:29,435 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:57:29,435 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:57:29,435 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:57:29,436 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:57:29,436 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:57:29,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:57:29,501 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:57:29,506 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:57:29,508 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:57:29,508 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:57:29,509 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2018-12-03 15:57:29,509 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2018-12-03 15:57:29,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:57:29,552 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:57:29,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:57:29,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:57:29,553 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:57:29,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,592 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:57:29,592 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:57:29,592 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:57:29,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:57:29,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:57:29,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:57:29,596 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:57:29,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,616 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... [2018-12-03 15:57:29,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:57:29,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:57:29,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:57:29,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:57:29,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:57:29,695 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2018-12-03 15:57:29,695 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2018-12-03 15:57:29,891 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:57:29,891 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:57:29,892 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:57:29 BoogieIcfgContainer [2018-12-03 15:57:29,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:57:29,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:57:29,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:57:29,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:57:29,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:57:29" (1/2) ... [2018-12-03 15:57:29,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df5e29c and model type doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:57:29, skipping insertion in model container [2018-12-03 15:57:29,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:57:29" (2/2) ... [2018-12-03 15:57:29,900 INFO L112 eAbstractionObserver]: Analyzing ICFG doubleLoopUniformIterations.bpl [2018-12-03 15:57:29,910 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:57:29,919 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-03 15:57:29,941 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-03 15:57:29,982 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:57:29,982 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:57:29,983 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:57:29,983 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:57:29,983 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:57:29,983 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:57:29,983 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:57:29,984 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:57:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 15:57:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:57:30,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:30,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:57:30,023 INFO L423 AbstractCegarLoop]: === Iteration 1 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:30,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:30,034 INFO L82 PathProgramCache]: Analyzing trace with hash 926725, now seen corresponding path program 1 times [2018-12-03 15:57:30,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:30,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:30,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:30,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:57:30,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 15:57:30,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:57:30,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:57:30,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:57:30,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:57:30,182 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-03 15:57:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:30,239 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-03 15:57:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:57:30,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 15:57:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:30,252 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:57:30,252 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:57:30,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:57:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:57:30,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:57:30,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:57:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-03 15:57:30,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2018-12-03 15:57:30,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:30,286 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-03 15:57:30,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:57:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-03 15:57:30,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:57:30,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:30,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:57:30,287 INFO L423 AbstractCegarLoop]: === Iteration 2 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:30,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:30,288 INFO L82 PathProgramCache]: Analyzing trace with hash 28728519, now seen corresponding path program 1 times [2018-12-03 15:57:30,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:30,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:30,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:57:30,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 15:57:30,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:57:30,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:57:30,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:57:30,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:57:30,315 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 3 states. [2018-12-03 15:57:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:30,371 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 15:57:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:57:30,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 15:57:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:30,372 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:57:30,372 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:57:30,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:57:30,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:57:30,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:57:30,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:57:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:57:30,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 15:57:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:30,377 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:57:30,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:57:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:57:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:57:30,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:30,378 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:57:30,378 INFO L423 AbstractCegarLoop]: === Iteration 3 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:30,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 891297133, now seen corresponding path program 1 times [2018-12-03 15:57:30,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:30,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:30,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:30,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:57:30,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:57:30,550 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:57:30,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:57:30,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:57:30,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:57:30,551 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 15:57:30,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:30,616 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 15:57:30,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:57:30,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:57:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:30,617 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:57:30,618 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:57:30,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:57:30,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:57:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:57:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:57:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 15:57:30,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 15:57:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:30,622 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 15:57:30,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:57:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 15:57:30,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:57:30,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:30,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:57:30,623 INFO L423 AbstractCegarLoop]: === Iteration 4 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:30,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1860345825, now seen corresponding path program 1 times [2018-12-03 15:57:30,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:30,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:30,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:30,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:30,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:30,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:30,735 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 15:57:30,737 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13] [2018-12-03 15:57:30,772 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:57:30,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:57:30,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:57:30,916 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 4 different actions 6 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:57:30,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:30,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:57:30,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:30,932 INFO L192 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 [2018-12-03 15:57:30,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:30,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:30,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:31,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:31,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2018-12-03 15:57:31,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:31,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:57:31,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:57:31,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:57:31,101 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 15:57:31,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:31,131 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-03 15:57:31,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:57:31,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 15:57:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:31,132 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:57:31,132 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:57:31,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:57:31,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:57:31,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-03 15:57:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:57:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-03 15:57:31,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-12-03 15:57:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:31,137 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-03 15:57:31,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:57:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-03 15:57:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:57:31,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:31,138 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:57:31,138 INFO L423 AbstractCegarLoop]: === Iteration 5 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:31,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:31,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1836084205, now seen corresponding path program 2 times [2018-12-03 15:57:31,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:31,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:31,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:31,201 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:31,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:31,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:31,202 INFO L192 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 [2018-12-03 15:57:31,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:31,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:31,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:57:31,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:31,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:31,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 15:57:31,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:31,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:57:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:57:31,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:57:31,376 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-12-03 15:57:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:31,567 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-03 15:57:31,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:57:31,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-03 15:57:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:31,569 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:57:31,569 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:57:31,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:57:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:57:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:57:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:57:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:57:31,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-12-03 15:57:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:31,574 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:57:31,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:57:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:57:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:57:31,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:31,575 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:57:31,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:31,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:31,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1860095751, now seen corresponding path program 3 times [2018-12-03 15:57:31,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:31,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:31,636 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:31,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:31,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:31,636 INFO L192 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 [2018-12-03 15:57:31,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:31,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:31,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:31,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:31,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:31,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 15:57:31,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:31,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:57:31,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:57:31,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:57:31,763 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-03 15:57:31,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:31,809 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 15:57:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:57:31,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-03 15:57:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:31,810 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:57:31,810 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:57:31,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:57:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:57:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:57:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:57:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 15:57:31,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-12-03 15:57:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:31,814 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 15:57:31,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:57:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 15:57:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:57:31,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:31,815 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:57:31,815 INFO L423 AbstractCegarLoop]: === Iteration 7 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:31,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1828331911, now seen corresponding path program 4 times [2018-12-03 15:57:31,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:32,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:32,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:32,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:32,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,016 INFO L192 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 [2018-12-03 15:57:32,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:32,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:32,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:32,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:32,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2018-12-03 15:57:32,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:32,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:57:32,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:57:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:57:32,095 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2018-12-03 15:57:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:32,190 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 15:57:32,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:57:32,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 15:57:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:32,193 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:57:32,193 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:57:32,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:57:32,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:57:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-12-03 15:57:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:57:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 15:57:32,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-12-03 15:57:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:32,198 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 15:57:32,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:57:32,198 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 15:57:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:57:32,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:32,199 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-12-03 15:57:32,199 INFO L423 AbstractCegarLoop]: === Iteration 8 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:32,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 843652871, now seen corresponding path program 5 times [2018-12-03 15:57:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:32,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:32,263 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:32,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:32,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,264 INFO L192 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 [2018-12-03 15:57:32,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:32,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:32,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:57:32,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:32,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:32,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 15:57:32,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:32,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:57:32,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:57:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:57:32,385 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 6 states. [2018-12-03 15:57:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:32,458 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-03 15:57:32,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:57:32,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 15:57:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:32,459 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:57:32,460 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:57:32,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:57:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:57:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:57:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:57:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 15:57:32,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-12-03 15:57:32,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:32,464 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 15:57:32,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:57:32,464 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 15:57:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:57:32,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:32,464 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-12-03 15:57:32,465 INFO L423 AbstractCegarLoop]: === Iteration 9 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:32,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:32,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1588010797, now seen corresponding path program 6 times [2018-12-03 15:57:32,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:32,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:32,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:32,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:32,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:32,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:32,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,544 INFO L192 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 [2018-12-03 15:57:32,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:32,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:32,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:32,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:32,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:32,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 15:57:32,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:32,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:57:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:57:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:57:32,948 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-03 15:57:32,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:32,977 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 15:57:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:57:32,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 15:57:32,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:32,979 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:57:32,979 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:57:32,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:57:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:57:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:57:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:57:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 15:57:32,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-12-03 15:57:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:32,983 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 15:57:32,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:57:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 15:57:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:57:32,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:32,984 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:57:32,984 INFO L423 AbstractCegarLoop]: === Iteration 10 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:32,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:32,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1983632929, now seen corresponding path program 7 times [2018-12-03 15:57:32,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:32,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:32,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:33,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:33,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:33,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,174 INFO L192 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 [2018-12-03 15:57:33,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:33,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:33,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 15:57:33,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:33,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:57:33,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:57:33,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:57:33,258 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2018-12-03 15:57:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:33,322 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-12-03 15:57:33,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:57:33,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-03 15:57:33,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:33,323 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:57:33,324 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:57:33,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:57:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:57:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-12-03 15:57:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:57:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 15:57:33,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 15:57:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:33,329 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 15:57:33,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:57:33,329 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 15:57:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:57:33,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:33,330 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-12-03 15:57:33,330 INFO L423 AbstractCegarLoop]: === Iteration 11 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:33,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1363017133, now seen corresponding path program 8 times [2018-12-03 15:57:33,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:33,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:33,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:33,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:33,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,393 INFO L192 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 [2018-12-03 15:57:33,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:33,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:33,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:57:33,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:33,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:33,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:57:33,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:33,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:57:33,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:57:33,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:57:33,636 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2018-12-03 15:57:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:33,674 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-03 15:57:33,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:57:33,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 15:57:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:33,675 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:57:33,675 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:57:33,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:57:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:57:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:57:33,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:57:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 15:57:33,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-12-03 15:57:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:33,679 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 15:57:33,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:57:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 15:57:33,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:57:33,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:33,680 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-12-03 15:57:33,680 INFO L423 AbstractCegarLoop]: === Iteration 12 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:33,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:33,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1331690937, now seen corresponding path program 9 times [2018-12-03 15:57:33,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:33,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:33,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:33,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:33,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,761 INFO L192 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 [2018-12-03 15:57:33,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:33,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:33,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:33,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:33,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:33,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:57:33,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:33,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:57:33,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:57:33,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:57:33,943 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-03 15:57:34,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:34,030 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-03 15:57:34,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:57:34,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 15:57:34,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:34,031 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:57:34,031 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:57:34,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:57:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:57:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:57:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:57:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-03 15:57:34,036 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-12-03 15:57:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:34,036 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-03 15:57:34,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:57:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-03 15:57:34,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:57:34,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:34,037 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2018-12-03 15:57:34,038 INFO L423 AbstractCegarLoop]: === Iteration 13 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:34,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1667192391, now seen corresponding path program 10 times [2018-12-03 15:57:34,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:34,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:34,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:34,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:34,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,151 INFO L192 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 [2018-12-03 15:57:34,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:34,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:34,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:34,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 15:57:34,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:34,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:57:34,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:57:34,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:57:34,255 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-12-03 15:57:34,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:34,395 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-12-03 15:57:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:57:34,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-03 15:57:34,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:34,396 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:57:34,397 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:57:34,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:57:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:57:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-12-03 15:57:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:57:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 15:57:34,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 15:57:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:34,403 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 15:57:34,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:57:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 15:57:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:57:34,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:34,404 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-12-03 15:57:34,404 INFO L423 AbstractCegarLoop]: === Iteration 14 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:34,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:34,404 INFO L82 PathProgramCache]: Analyzing trace with hash 143295047, now seen corresponding path program 11 times [2018-12-03 15:57:34,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:34,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:34,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:34,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:34,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,484 INFO L192 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 [2018-12-03 15:57:34,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:34,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:34,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:57:34,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:34,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:34,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:57:34,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:34,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:57:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:57:34,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:57:34,623 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2018-12-03 15:57:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:34,657 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-03 15:57:34,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:57:34,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 15:57:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:34,658 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:57:34,659 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:57:34,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:57:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:57:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:57:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:57:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 15:57:34,664 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-12-03 15:57:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:34,664 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 15:57:34,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:57:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 15:57:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:57:34,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:34,665 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-12-03 15:57:34,665 INFO L423 AbstractCegarLoop]: === Iteration 15 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:34,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:34,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1788276499, now seen corresponding path program 12 times [2018-12-03 15:57:34,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:34,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:34,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:34,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:34,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:34,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:34,812 INFO L192 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 [2018-12-03 15:57:34,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:34,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:34,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:34,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:34,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:34,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:34,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:57:34,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:34,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:57:35,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:57:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:57:35,000 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-03 15:57:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:35,050 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-03 15:57:35,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:57:35,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 15:57:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:35,051 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:57:35,051 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:57:35,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:57:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:57:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:57:35,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:57:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 15:57:35,056 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 15:57:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:35,056 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 15:57:35,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:57:35,056 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 15:57:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:57:35,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:35,057 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2018-12-03 15:57:35,057 INFO L423 AbstractCegarLoop]: === Iteration 16 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:35,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash 397941857, now seen corresponding path program 13 times [2018-12-03 15:57:35,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:35,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:35,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:35,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:35,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:35,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,169 INFO L192 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 [2018-12-03 15:57:35,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:35,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:35,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:35,215 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:35,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:35,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 15:57:35,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:35,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:57:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:57:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:57:35,250 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2018-12-03 15:57:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:35,335 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-03 15:57:35,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:57:35,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 15:57:35,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:35,336 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:57:35,336 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:57:35,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:57:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:57:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 15:57:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 15:57:35,341 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 15:57:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:35,341 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 15:57:35,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:57:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 15:57:35,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:57:35,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:35,342 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-12-03 15:57:35,342 INFO L423 AbstractCegarLoop]: === Iteration 17 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:35,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:35,342 INFO L82 PathProgramCache]: Analyzing trace with hash -548765843, now seen corresponding path program 14 times [2018-12-03 15:57:35,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:35,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:35,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:35,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:35,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:35,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,438 INFO L192 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 [2018-12-03 15:57:35,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:35,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:35,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:57:35,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:35,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:35,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 15:57:35,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:35,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:57:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:57:35,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:57:35,617 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2018-12-03 15:57:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:35,664 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 15:57:35,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:57:35,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:57:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:35,665 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:57:35,666 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:57:35,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:57:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:57:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:57:35,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:57:35,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-03 15:57:35,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-12-03 15:57:35,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:35,670 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-03 15:57:35,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:57:35,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-03 15:57:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:57:35,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:35,671 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-12-03 15:57:35,671 INFO L423 AbstractCegarLoop]: === Iteration 18 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:35,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash -297941625, now seen corresponding path program 15 times [2018-12-03 15:57:35,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:35,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:35,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:35,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:35,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:35,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:35,864 INFO L192 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 [2018-12-03 15:57:35,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:35,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:35,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:35,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:35,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:36,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 15:57:36,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:36,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:57:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:57:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:57:36,057 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-03 15:57:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:36,097 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 15:57:36,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:57:36,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 15:57:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:36,099 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:57:36,099 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:57:36,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:57:36,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:57:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:57:36,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:57:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-03 15:57:36,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-12-03 15:57:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:36,103 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-03 15:57:36,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:57:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-03 15:57:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:57:36,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:36,104 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2018-12-03 15:57:36,104 INFO L423 AbstractCegarLoop]: === Iteration 19 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:36,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:36,105 INFO L82 PathProgramCache]: Analyzing trace with hash -646317305, now seen corresponding path program 16 times [2018-12-03 15:57:36,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:36,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:36,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:36,720 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:36,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:36,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:36,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:36,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:36,721 INFO L192 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 [2018-12-03 15:57:36,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:36,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:36,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:36,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 15:57:36,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:36,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:57:36,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:57:36,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:57:36,905 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2018-12-03 15:57:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:37,267 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-12-03 15:57:37,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:57:37,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-03 15:57:37,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:37,269 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:57:37,269 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:37,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:57:37,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-12-03 15:57:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:57:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 15:57:37,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 15:57:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:37,276 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 15:57:37,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:57:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 15:57:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:57:37,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:37,277 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-12-03 15:57:37,277 INFO L423 AbstractCegarLoop]: === Iteration 20 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:37,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1438938503, now seen corresponding path program 17 times [2018-12-03 15:57:37,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:37,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:37,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:37,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,395 INFO L192 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 [2018-12-03 15:57:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:37,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:37,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:37,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:37,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:37,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 15:57:37,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:37,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:57:37,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:57:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:57:37,607 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2018-12-03 15:57:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:37,749 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-03 15:57:37,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:57:37,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 15:57:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:37,749 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:37,750 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:57:37,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:57:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:57:37,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:57:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:57:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 15:57:37,755 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-12-03 15:57:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:37,755 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 15:57:37,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:57:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 15:57:37,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:57:37,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:37,756 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-12-03 15:57:37,756 INFO L423 AbstractCegarLoop]: === Iteration 21 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:37,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:37,757 INFO L82 PathProgramCache]: Analyzing trace with hash 624554669, now seen corresponding path program 18 times [2018-12-03 15:57:37,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:37,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:37,926 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:37,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:37,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:37,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,927 INFO L192 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 [2018-12-03 15:57:37,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:37,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:37,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:37,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:37,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:38,220 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:38,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 15:57:38,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:38,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:57:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:57:38,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:57:38,243 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-03 15:57:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:38,296 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-03 15:57:38,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:57:38,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 15:57:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:38,297 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:57:38,297 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:57:38,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:57:38,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:57:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:57:38,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:57:38,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-03 15:57:38,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-12-03 15:57:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:38,302 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-03 15:57:38,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:57:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-03 15:57:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:57:38,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:38,303 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2018-12-03 15:57:38,303 INFO L423 AbstractCegarLoop]: === Iteration 22 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:38,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2113703263, now seen corresponding path program 19 times [2018-12-03 15:57:38,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:38,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:38,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:38,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:38,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:38,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:38,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:38,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:38,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:38,433 INFO L192 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 [2018-12-03 15:57:38,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:38,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:38,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:38,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:38,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 15:57:38,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:38,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:57:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:57:38,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:57:38,522 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2018-12-03 15:57:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:38,754 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-03 15:57:38,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:57:38,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-12-03 15:57:38,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:38,755 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:57:38,755 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:38,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:57:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-12-03 15:57:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:57:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 15:57:38,759 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 15:57:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:38,759 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 15:57:38,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:57:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 15:57:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:57:38,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:38,760 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-12-03 15:57:38,760 INFO L423 AbstractCegarLoop]: === Iteration 23 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:38,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1100353235, now seen corresponding path program 20 times [2018-12-03 15:57:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:38,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:39,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:39,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:39,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,095 INFO L192 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 [2018-12-03 15:57:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:39,103 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:39,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:57:39,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:39,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:39,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 15:57:39,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:39,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:39,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:39,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:57:39,300 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2018-12-03 15:57:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:39,344 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-12-03 15:57:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:39,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:57:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:39,345 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:57:39,345 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:57:39,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:57:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:57:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:57:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:57:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 15:57:39,350 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-12-03 15:57:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:39,350 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 15:57:39,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 15:57:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:57:39,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:39,351 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-12-03 15:57:39,351 INFO L423 AbstractCegarLoop]: === Iteration 24 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:39,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:39,352 INFO L82 PathProgramCache]: Analyzing trace with hash -576448313, now seen corresponding path program 21 times [2018-12-03 15:57:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:39,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:39,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:39,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:39,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:39,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:39,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:39,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,607 INFO L192 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 [2018-12-03 15:57:39,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:39,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:39,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:39,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:39,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:39,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 15:57:39,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:39,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:57:39,803 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-03 15:57:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:39,846 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-03 15:57:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:39,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:57:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:39,848 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:57:39,848 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:57:39,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:57:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:57:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:57:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:57:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-03 15:57:39,852 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-03 15:57:39,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:39,853 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-03 15:57:39,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-03 15:57:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:57:39,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:39,854 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2018-12-03 15:57:39,854 INFO L423 AbstractCegarLoop]: === Iteration 25 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:39,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -690090041, now seen corresponding path program 22 times [2018-12-03 15:57:39,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:39,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:39,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:39,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:39,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:40,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:40,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:40,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,182 INFO L192 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 [2018-12-03 15:57:40,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:40,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:40,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:40,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 15:57:40,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:40,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:57:40,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:57:40,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:57:40,266 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2018-12-03 15:57:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:40,410 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-03 15:57:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:57:40,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-12-03 15:57:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:40,412 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:57:40,412 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:57:40,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:57:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:57:40,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-12-03 15:57:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:57:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 15:57:40,417 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 15:57:40,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:40,417 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 15:57:40,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:57:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 15:57:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:57:40,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:40,418 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-12-03 15:57:40,418 INFO L423 AbstractCegarLoop]: === Iteration 26 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:40,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 81983687, now seen corresponding path program 23 times [2018-12-03 15:57:40,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:40,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:40,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:40,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,515 INFO L192 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 [2018-12-03 15:57:40,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:40,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:40,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:57:40,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:40,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:40,697 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:40,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 15:57:40,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:40,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:57:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:57:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:57:40,717 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2018-12-03 15:57:40,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:40,790 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-03 15:57:40,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:57:40,790 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 15:57:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:40,791 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:57:40,791 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:57:40,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 18 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:57:40,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:57:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:57:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:57:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-03 15:57:40,796 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-12-03 15:57:40,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:40,797 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-03 15:57:40,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:57:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-03 15:57:40,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:57:40,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:40,798 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-12-03 15:57:40,798 INFO L423 AbstractCegarLoop]: === Iteration 27 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:40,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:40,798 INFO L82 PathProgramCache]: Analyzing trace with hash -856832915, now seen corresponding path program 24 times [2018-12-03 15:57:40,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:40,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:40,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:40,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:40,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:40,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:40,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:40,951 INFO L192 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 [2018-12-03 15:57:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:40,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:40,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:40,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:40,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:40,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:41,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 15:57:41,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:41,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:57:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:57:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:57:41,170 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-03 15:57:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:41,251 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 15:57:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:57:41,252 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 15:57:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:41,252 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:57:41,252 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:57:41,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 18 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:57:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:57:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:57:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:57:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 15:57:41,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-12-03 15:57:41,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:41,259 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 15:57:41,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:57:41,259 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 15:57:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:57:41,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:41,260 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2018-12-03 15:57:41,260 INFO L423 AbstractCegarLoop]: === Iteration 28 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:41,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:41,261 INFO L82 PathProgramCache]: Analyzing trace with hash -792078111, now seen corresponding path program 25 times [2018-12-03 15:57:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:41,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:41,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:41,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:41,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:41,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:41,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:41,572 INFO L192 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 [2018-12-03 15:57:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:41,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:41,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:41,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 15:57:41,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:41,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:57:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:57:41,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:57:41,662 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-12-03 15:57:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:41,948 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-12-03 15:57:41,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:57:41,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-03 15:57:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:41,950 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:57:41,950 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:57:41,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:57:41,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:57:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-12-03 15:57:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:57:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 15:57:41,954 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 15:57:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:41,954 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 15:57:41,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:57:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 15:57:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:57:41,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:41,955 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-12-03 15:57:41,956 INFO L423 AbstractCegarLoop]: === Iteration 29 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:41,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:41,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1215320813, now seen corresponding path program 26 times [2018-12-03 15:57:41,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:41,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:41,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:41,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:41,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:42,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:42,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:42,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:42,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:42,093 INFO L192 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 [2018-12-03 15:57:42,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:42,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:42,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:57:42,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:42,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:42,301 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:42,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 15:57:42,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:42,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:57:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:57:42,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:57:42,323 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2018-12-03 15:57:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:42,380 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-03 15:57:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:57:42,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 15:57:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:42,380 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:57:42,380 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:57:42,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 20 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:57:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:57:42,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:57:42,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:57:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 15:57:42,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-12-03 15:57:42,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:42,385 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 15:57:42,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:57:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 15:57:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:57:42,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:42,386 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-12-03 15:57:42,386 INFO L423 AbstractCegarLoop]: === Iteration 30 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:42,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2118190073, now seen corresponding path program 27 times [2018-12-03 15:57:42,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:42,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:42,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:43,019 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:43,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:43,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:43,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,020 INFO L192 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 [2018-12-03 15:57:43,035 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:43,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:43,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:43,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:43,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:43,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 15:57:43,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:43,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:57:43,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:57:43,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:57:43,244 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 15:57:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:43,276 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-03 15:57:43,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:57:43,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 15:57:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:43,278 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:57:43,278 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:57:43,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 20 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:57:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:57:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:57:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:57:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-12-03 15:57:43,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-12-03 15:57:43,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:43,282 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-12-03 15:57:43,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:57:43,282 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-12-03 15:57:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:57:43,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:43,283 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2018-12-03 15:57:43,283 INFO L423 AbstractCegarLoop]: === Iteration 31 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:43,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:43,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1239444345, now seen corresponding path program 28 times [2018-12-03 15:57:43,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:43,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:43,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:43,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:43,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:43,457 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:43,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:43,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:43,458 INFO L192 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 [2018-12-03 15:57:43,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:43,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:43,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:43,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 15:57:43,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:43,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:57:43,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:57:43,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:57:43,574 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2018-12-03 15:57:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:43,934 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-12-03 15:57:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:57:43,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-12-03 15:57:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:43,936 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:57:43,936 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:57:43,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:57:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:57:43,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-03 15:57:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:57:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 15:57:43,940 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 15:57:43,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:43,941 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 15:57:43,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:57:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 15:57:43,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:57:43,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:43,942 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-12-03 15:57:43,942 INFO L423 AbstractCegarLoop]: === Iteration 32 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:43,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash 231869447, now seen corresponding path program 29 times [2018-12-03 15:57:43,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:43,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:43,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:44,136 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:44,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:44,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:44,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:44,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:44,137 INFO L192 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 [2018-12-03 15:57:44,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:44,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:44,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:57:44,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:44,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:44,366 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:44,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 15:57:44,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:44,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:57:44,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:57:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:57:44,386 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-12-03 15:57:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:44,455 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 15:57:44,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:57:44,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 15:57:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:44,456 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:57:44,456 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:57:44,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 22 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:57:44,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:57:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:57:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:57:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 15:57:44,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-12-03 15:57:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:44,461 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 15:57:44,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:57:44,461 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 15:57:44,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:57:44,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:44,462 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-12-03 15:57:44,462 INFO L423 AbstractCegarLoop]: === Iteration 33 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:44,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:44,462 INFO L82 PathProgramCache]: Analyzing trace with hash -27752915, now seen corresponding path program 30 times [2018-12-03 15:57:44,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:44,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:44,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:44,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:44,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:44,637 INFO L192 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 [2018-12-03 15:57:44,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:44,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:44,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:44,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:44,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:44,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 15:57:44,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:44,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:57:44,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:57:44,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:57:44,838 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-03 15:57:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:44,917 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 15:57:44,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:57:44,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 15:57:44,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:44,918 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:44,919 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:44,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 22 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:57:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:57:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:57:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 15:57:44,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 15:57:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:44,923 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 15:57:44,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:57:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 15:57:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:57:44,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:44,924 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1] [2018-12-03 15:57:44,924 INFO L423 AbstractCegarLoop]: === Iteration 34 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:44,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash -860401887, now seen corresponding path program 31 times [2018-12-03 15:57:44,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:45,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:45,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:45,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:45,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:45,332 INFO L192 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 [2018-12-03 15:57:45,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:45,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:45,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:45,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 15:57:45,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:45,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:57:45,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:57:45,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:57:45,395 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-03 15:57:45,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:45,655 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-03 15:57:45,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:57:45,656 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 15:57:45,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:45,657 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:57:45,657 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:57:45,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:57:45,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:57:45,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-12-03 15:57:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:57:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 15:57:45,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-12-03 15:57:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:45,662 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 15:57:45,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:57:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 15:57:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:57:45,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:45,663 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-12-03 15:57:45,663 INFO L423 AbstractCegarLoop]: === Iteration 35 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:45,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:45,664 INFO L82 PathProgramCache]: Analyzing trace with hash -902716243, now seen corresponding path program 32 times [2018-12-03 15:57:45,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:45,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:45,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:45,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:45,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:45,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:45,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:45,909 INFO L192 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 [2018-12-03 15:57:45,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:45,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:45,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:57:45,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:45,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:46,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 15:57:46,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:46,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:57:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:57:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:57:46,312 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 15 states. [2018-12-03 15:57:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:46,384 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-12-03 15:57:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:57:46,385 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 15:57:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:46,385 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:57:46,385 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:46,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 24 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:57:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:57:46,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:57:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-03 15:57:46,390 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-12-03 15:57:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:46,390 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-03 15:57:46,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:57:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-03 15:57:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:57:46,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:46,391 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-12-03 15:57:46,392 INFO L423 AbstractCegarLoop]: === Iteration 36 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:46,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash -361074873, now seen corresponding path program 33 times [2018-12-03 15:57:46,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:46,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:46,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:46,514 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:46,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:46,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:46,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,515 INFO L192 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 [2018-12-03 15:57:46,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:46,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:46,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:46,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:46,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:46,566 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:46,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 15:57:46,788 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:46,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:57:46,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:57:46,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:57:46,789 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-03 15:57:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:47,104 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 15:57:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:57:47,105 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 15:57:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:47,105 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:57:47,105 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:57:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 24 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:57:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:57:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:57:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:57:47,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-03 15:57:47,110 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-12-03 15:57:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:47,111 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-03 15:57:47,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:57:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-03 15:57:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:57:47,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:47,112 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2018-12-03 15:57:47,113 INFO L423 AbstractCegarLoop]: === Iteration 37 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:47,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1691519303, now seen corresponding path program 34 times [2018-12-03 15:57:47,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:47,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:47,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:47,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:47,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:47,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:47,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:47,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:47,483 INFO L192 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 [2018-12-03 15:57:47,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:47,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:47,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:47,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:47,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:47,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 15:57:47,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:47,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:57:47,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:57:47,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:57:47,619 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-12-03 15:57:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:48,009 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-03 15:57:48,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:57:48,009 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-12-03 15:57:48,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:48,010 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:57:48,010 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:57:48,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:57:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:57:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-12-03 15:57:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:57:48,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-03 15:57:48,015 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-12-03 15:57:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:48,015 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-03 15:57:48,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:57:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-03 15:57:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:57:48,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:48,016 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-12-03 15:57:48,017 INFO L423 AbstractCegarLoop]: === Iteration 38 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:48,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:48,017 INFO L82 PathProgramCache]: Analyzing trace with hash 897429319, now seen corresponding path program 35 times [2018-12-03 15:57:48,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:48,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:48,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:48,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:48,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:48,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:48,464 INFO L192 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 [2018-12-03 15:57:48,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:48,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:48,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:57:48,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:48,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:48,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 15:57:48,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:48,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:57:48,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:57:48,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:57:48,763 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 16 states. [2018-12-03 15:57:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:48,858 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-03 15:57:48,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:57:48,858 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 15:57:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:48,858 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:57:48,859 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:57:48,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 26 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:57:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:57:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:57:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:57:48,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 15:57:48,862 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-12-03 15:57:48,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:48,862 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 15:57:48,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:57:48,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 15:57:48,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:57:48,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:48,863 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-12-03 15:57:48,863 INFO L423 AbstractCegarLoop]: === Iteration 39 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:48,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:48,863 INFO L82 PathProgramCache]: Analyzing trace with hash 508442605, now seen corresponding path program 36 times [2018-12-03 15:57:48,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:48,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:48,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:49,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:49,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:49,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,405 INFO L192 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 [2018-12-03 15:57:49,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:49,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:49,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:49,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:49,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:49,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 15:57:49,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:49,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:57:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:57:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:57:49,647 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-03 15:57:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:49,689 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 15:57:49,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:57:49,690 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 15:57:49,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:49,691 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:57:49,691 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:57:49,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 26 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:57:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:57:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:57:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:57:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-03 15:57:49,694 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-12-03 15:57:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:49,695 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-03 15:57:49,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:57:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-03 15:57:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:57:49,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:49,695 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1] [2018-12-03 15:57:49,696 INFO L423 AbstractCegarLoop]: === Iteration 40 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:49,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1418209951, now seen corresponding path program 37 times [2018-12-03 15:57:49,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:49,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:49,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:49,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:49,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:49,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:49,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:49,979 INFO L192 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 [2018-12-03 15:57:49,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:49,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:50,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:50,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 15:57:50,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:50,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:57:50,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:57:50,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:57:50,102 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2018-12-03 15:57:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:50,687 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-03 15:57:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:57:50,688 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-12-03 15:57:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:50,688 INFO L225 Difference]: With dead ends: 50 [2018-12-03 15:57:50,689 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:57:50,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:57:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:57:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-12-03 15:57:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:57:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-03 15:57:50,691 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-12-03 15:57:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:50,692 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-03 15:57:50,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:57:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-03 15:57:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:57:50,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:50,692 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-12-03 15:57:50,692 INFO L423 AbstractCegarLoop]: === Iteration 41 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:50,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1014897043, now seen corresponding path program 38 times [2018-12-03 15:57:50,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:50,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:50,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:51,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:51,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:51,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:51,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:51,222 INFO L192 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 [2018-12-03 15:57:51,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:51,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:51,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:57:51,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:51,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:51,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 15:57:51,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:51,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:57:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:57:51,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:57:51,829 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 17 states. [2018-12-03 15:57:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:51,907 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-03 15:57:51,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:57:51,908 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 15:57:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:51,909 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:57:51,909 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:57:51,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 28 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:57:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:57:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:57:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:57:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 15:57:51,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-12-03 15:57:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:51,912 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 15:57:51,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:57:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 15:57:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:57:51,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:51,913 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-12-03 15:57:51,913 INFO L423 AbstractCegarLoop]: === Iteration 42 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:51,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash -188583289, now seen corresponding path program 39 times [2018-12-03 15:57:51,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:51,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:51,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:51,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:52,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:52,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:52,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:52,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:52,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:52,048 INFO L192 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 [2018-12-03 15:57:52,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:52,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:52,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:52,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:52,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:52,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:52,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:52,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 15:57:52,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:52,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:57:52,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:57:52,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:57:52,699 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-03 15:57:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:52,746 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-03 15:57:52,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:57:52,747 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 15:57:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:52,747 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:57:52,747 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:57:52,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 28 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:57:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:57:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:57:52,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:57:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-03 15:57:52,751 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-12-03 15:57:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:52,751 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-03 15:57:52,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:57:52,751 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-03 15:57:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:57:52,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:52,752 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1] [2018-12-03 15:57:52,752 INFO L423 AbstractCegarLoop]: === Iteration 43 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:52,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1551176185, now seen corresponding path program 40 times [2018-12-03 15:57:52,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:52,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:52,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:52,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:52,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:53,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:53,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:53,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:53,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:53,039 INFO L192 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 [2018-12-03 15:57:53,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:53,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:53,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:53,093 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:53,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 15:57:53,112 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:53,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:57:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:57:53,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:57:53,113 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2018-12-03 15:57:53,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:53,414 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-12-03 15:57:53,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:57:53,414 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-12-03 15:57:53,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:53,415 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:57:53,415 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:57:53,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:57:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:57:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-12-03 15:57:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:57:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-03 15:57:53,420 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-12-03 15:57:53,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:53,420 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-03 15:57:53,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:57:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-03 15:57:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:57:53,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:53,421 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-12-03 15:57:53,421 INFO L423 AbstractCegarLoop]: === Iteration 44 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:53,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:53,422 INFO L82 PathProgramCache]: Analyzing trace with hash -841883001, now seen corresponding path program 41 times [2018-12-03 15:57:53,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:53,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:53,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:53,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:53,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:53,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:53,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:53,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:53,567 INFO L192 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 [2018-12-03 15:57:53,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:53,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:53,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:57:53,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:53,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:53,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:53,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 15:57:53,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:53,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:57:53,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:57:53,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:57:53,834 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 18 states. [2018-12-03 15:57:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:53,909 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-03 15:57:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:57:53,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 15:57:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:53,910 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:57:53,910 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:57:53,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 30 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:57:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:57:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:57:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:57:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-03 15:57:53,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-12-03 15:57:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:53,914 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-03 15:57:53,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:57:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-03 15:57:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:57:53,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:53,915 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-12-03 15:57:53,915 INFO L423 AbstractCegarLoop]: === Iteration 45 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:53,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash -995960403, now seen corresponding path program 42 times [2018-12-03 15:57:53,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:53,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:53,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:53,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:53,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:54,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:54,597 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:54,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:54,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:54,598 INFO L192 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 [2018-12-03 15:57:54,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:54,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:54,627 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:54,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:54,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:54,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:55,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 15:57:55,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:55,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:57:55,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:57:55,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:57:55,029 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-03 15:57:55,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:55,115 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 15:57:55,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:57:55,115 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 15:57:55,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:55,116 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:57:55,116 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:57:55,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 30 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:57:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:57:55,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:57:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:57:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 15:57:55,122 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-12-03 15:57:55,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:55,122 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 15:57:55,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:57:55,122 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 15:57:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:57:55,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:55,123 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1] [2018-12-03 15:57:55,123 INFO L423 AbstractCegarLoop]: === Iteration 46 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:55,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:55,123 INFO L82 PathProgramCache]: Analyzing trace with hash -810062943, now seen corresponding path program 43 times [2018-12-03 15:57:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:55,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:55,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:55,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:55,573 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:55,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:55,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:55,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,574 INFO L192 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 [2018-12-03 15:57:55,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:55,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:55,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:55,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 15:57:55,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:55,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:57:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:57:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:57:55,655 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 18 states. [2018-12-03 15:57:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:56,026 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-03 15:57:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:57:56,027 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-12-03 15:57:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:56,027 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:57:56,027 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:57:56,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:57:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:57:56,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-12-03 15:57:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:57:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 15:57:56,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-12-03 15:57:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:56,031 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 15:57:56,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:57:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 15:57:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:57:56,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:56,032 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-12-03 15:57:56,032 INFO L423 AbstractCegarLoop]: === Iteration 47 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:56,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:56,032 INFO L82 PathProgramCache]: Analyzing trace with hash 657791021, now seen corresponding path program 44 times [2018-12-03 15:57:56,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:56,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:56,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:56,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:56,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:56,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:56,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:56,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:56,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:56,330 INFO L192 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 [2018-12-03 15:57:56,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:56,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:56,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:57:56,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:56,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:56,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:56,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:56,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 15:57:56,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:56,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:57:56,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:57:56,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:57:56,893 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 19 states. [2018-12-03 15:57:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:56,990 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-03 15:57:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:57:56,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 15:57:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:56,992 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:57:56,992 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:57:56,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 32 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:57:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:57:56,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:57:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:57:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 15:57:56,995 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-12-03 15:57:56,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:56,996 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 15:57:56,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:57:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 15:57:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:57:56,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:56,996 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-12-03 15:57:56,996 INFO L423 AbstractCegarLoop]: === Iteration 48 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:56,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash 176358855, now seen corresponding path program 45 times [2018-12-03 15:57:56,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:56,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:56,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:56,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:57,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:57,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:57,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:57,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:57,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:57,185 INFO L192 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 [2018-12-03 15:57:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:57,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:57,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:57,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:57,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:57,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:57,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:57,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 15:57:57,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:57,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:57:57,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:57:57,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:57:57,964 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-03 15:57:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:58,024 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-12-03 15:57:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:57:58,025 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 15:57:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:58,025 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:57:58,025 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:57:58,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 32 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:57:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:57:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:57:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:57:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-03 15:57:58,029 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-12-03 15:57:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:58,030 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-03 15:57:58,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:57:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-03 15:57:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:57:58,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:58,031 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1] [2018-12-03 15:57:58,031 INFO L423 AbstractCegarLoop]: === Iteration 49 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:58,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1172095687, now seen corresponding path program 46 times [2018-12-03 15:57:58,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:58,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:58,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:58,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:58,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:58,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:58,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:58,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:58,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:58,408 INFO L192 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 [2018-12-03 15:57:58,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:58,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:58,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:58,445 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:58,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:58,452 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:58,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:58,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 15:57:58,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:58,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:57:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:57:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:57:58,471 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 19 states. [2018-12-03 15:57:59,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:59,139 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-03 15:57:59,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:57:59,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-12-03 15:57:59,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:59,140 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:57:59,140 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:57:59,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:57:59,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:57:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2018-12-03 15:57:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:57:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-03 15:57:59,144 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-12-03 15:57:59,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:59,144 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-03 15:57:59,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:57:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-03 15:57:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:57:59,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:59,145 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-12-03 15:57:59,145 INFO L423 AbstractCegarLoop]: === Iteration 50 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:59,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:59,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1975166407, now seen corresponding path program 47 times [2018-12-03 15:57:59,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:59,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:59,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:59,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:59,386 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:59,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:59,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:59,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:59,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:59,387 INFO L192 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 [2018-12-03 15:57:59,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:59,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:59,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:57:59,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:59,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:59,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 15:57:59,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:59,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:57:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:57:59,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:59,775 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 20 states. [2018-12-03 15:57:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:59,877 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-03 15:57:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:57:59,878 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 15:57:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:59,878 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:57:59,878 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:57:59,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 34 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:57:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:57:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:57:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:57:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 15:57:59,882 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-12-03 15:57:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:59,883 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 15:57:59,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:57:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 15:57:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:57:59,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:59,883 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-12-03 15:57:59,883 INFO L423 AbstractCegarLoop]: === Iteration 51 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:59,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash -64328851, now seen corresponding path program 48 times [2018-12-03 15:57:59,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:59,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:59,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:59,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:59,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:00,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:00,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:00,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:00,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:00,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:00,289 INFO L192 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 [2018-12-03 15:58:00,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:00,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:00,322 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:00,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:00,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:00,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:00,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:00,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 15:58:00,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:00,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:58:00,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:58:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:00,839 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-03 15:58:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:00,904 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-03 15:58:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:58:00,904 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 15:58:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:00,905 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:58:00,905 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:58:00,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 34 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:00,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:58:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:58:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:58:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 15:58:00,909 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 15:58:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:00,909 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 15:58:00,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:58:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 15:58:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:58:00,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:00,910 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1] [2018-12-03 15:58:00,910 INFO L423 AbstractCegarLoop]: === Iteration 52 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:00,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1994255903, now seen corresponding path program 49 times [2018-12-03 15:58:00,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:00,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:00,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:00,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:01,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:01,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:01,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:01,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:01,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:01,318 INFO L192 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 [2018-12-03 15:58:01,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:01,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:01,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:01,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:01,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:01,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 15:58:01,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:01,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:58:01,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:58:01,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:01,392 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 20 states. [2018-12-03 15:58:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:01,885 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-03 15:58:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:58:01,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-12-03 15:58:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:01,888 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:58:01,888 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:58:01,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:58:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:58:01,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-12-03 15:58:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:58:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 15:58:01,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-12-03 15:58:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:01,893 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 15:58:01,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:58:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 15:58:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:58:01,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:01,893 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-12-03 15:58:01,894 INFO L423 AbstractCegarLoop]: === Iteration 53 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:01,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1692452371, now seen corresponding path program 50 times [2018-12-03 15:58:01,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:01,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:02,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:02,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:02,328 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:02,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:02,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:02,328 INFO L192 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 [2018-12-03 15:58:02,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:02,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:02,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:58:02,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:02,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:02,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:02,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:02,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 15:58:02,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:02,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:58:02,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:58:02,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:58:02,660 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 21 states. [2018-12-03 15:58:02,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:02,776 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-03 15:58:02,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:58:02,777 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 15:58:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:02,777 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:58:02,778 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:58:02,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 36 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:58:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:58:02,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:58:02,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:58:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-03 15:58:02,781 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-12-03 15:58:02,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:02,781 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-03 15:58:02,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:58:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-03 15:58:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:58:02,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:02,782 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-12-03 15:58:02,782 INFO L423 AbstractCegarLoop]: === Iteration 54 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:02,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:02,782 INFO L82 PathProgramCache]: Analyzing trace with hash -492295929, now seen corresponding path program 51 times [2018-12-03 15:58:02,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:02,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:02,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:02,977 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:02,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:02,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:02,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:02,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:02,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:02,978 INFO L192 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 [2018-12-03 15:58:02,986 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:02,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:03,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:03,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:03,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:03,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:03,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:03,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 15:58:03,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:03,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:58:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:58:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:58:03,601 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-03 15:58:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:03,656 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 15:58:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:58:03,657 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 15:58:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:03,657 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:58:03,658 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:58:03,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 36 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:58:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:58:03,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:58:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:58:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-03 15:58:03,662 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-12-03 15:58:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:03,662 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-03 15:58:03,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:58:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-03 15:58:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:58:03,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:03,663 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1] [2018-12-03 15:58:03,663 INFO L423 AbstractCegarLoop]: === Iteration 55 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:03,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:03,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1918633863, now seen corresponding path program 52 times [2018-12-03 15:58:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:03,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:03,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:04,008 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:04,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:04,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:04,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:04,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:04,008 INFO L192 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 [2018-12-03 15:58:04,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:04,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:04,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:04,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 15:58:04,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:04,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:58:04,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:58:04,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:58:04,145 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2018-12-03 15:58:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:04,692 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-12-03 15:58:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:58:04,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-12-03 15:58:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:04,693 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:58:04,693 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:58:04,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:58:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:58:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2018-12-03 15:58:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:58:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-03 15:58:04,698 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-12-03 15:58:04,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:04,698 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-03 15:58:04,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:58:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-03 15:58:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:58:04,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:04,699 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-12-03 15:58:04,699 INFO L423 AbstractCegarLoop]: === Iteration 56 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:04,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash -651953913, now seen corresponding path program 53 times [2018-12-03 15:58:04,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:04,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:04,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:05,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:05,254 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:05,255 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:05,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:05,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:05,255 INFO L192 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 [2018-12-03 15:58:05,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:05,264 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:05,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:58:05,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:05,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:05,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:05,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:05,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 15:58:05,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:05,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:58:05,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:58:05,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:58:05,858 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 22 states. [2018-12-03 15:58:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:05,987 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-03 15:58:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:58:05,988 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 15:58:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:05,989 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:58:05,989 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:58:05,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 38 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:58:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:58:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:58:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:58:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 15:58:05,992 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2018-12-03 15:58:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:05,992 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 15:58:05,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:58:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 15:58:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:58:05,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:05,993 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-12-03 15:58:05,993 INFO L423 AbstractCegarLoop]: === Iteration 57 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:05,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:05,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2101809875, now seen corresponding path program 54 times [2018-12-03 15:58:05,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:05,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:05,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:05,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:06,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:06,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:06,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:06,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:06,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:06,961 INFO L192 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 [2018-12-03 15:58:06,971 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:06,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:06,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:06,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:06,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:07,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 15:58:07,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:07,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:58:07,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:58:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:58:07,325 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-03 15:58:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:07,381 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-03 15:58:07,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:58:07,382 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 15:58:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:07,383 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:58:07,383 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:58:07,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 38 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:58:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:58:07,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:58:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:58:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-03 15:58:07,387 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-12-03 15:58:07,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:07,387 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-03 15:58:07,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:58:07,387 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-03 15:58:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:58:07,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:07,387 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1] [2018-12-03 15:58:07,388 INFO L423 AbstractCegarLoop]: === Iteration 58 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:07,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -731658207, now seen corresponding path program 55 times [2018-12-03 15:58:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:07,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:07,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:07,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:07,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:07,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:07,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:07,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:07,719 INFO L192 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 [2018-12-03 15:58:07,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:07,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:07,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:07,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 15:58:07,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:07,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:58:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:58:07,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:58:07,804 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-12-03 15:58:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:08,365 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-03 15:58:08,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:58:08,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-12-03 15:58:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:08,367 INFO L225 Difference]: With dead ends: 68 [2018-12-03 15:58:08,367 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:58:08,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:58:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:58:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-12-03 15:58:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:58:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-12-03 15:58:08,372 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2018-12-03 15:58:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:08,372 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-12-03 15:58:08,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:58:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-12-03 15:58:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:58:08,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:08,373 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-12-03 15:58:08,373 INFO L423 AbstractCegarLoop]: === Iteration 59 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:08,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1206629459, now seen corresponding path program 56 times [2018-12-03 15:58:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:08,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:08,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:08,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:08,609 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:08,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:08,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:08,609 INFO L192 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 [2018-12-03 15:58:08,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:08,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:08,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:58:08,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:08,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:09,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:09,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 15:58:09,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:09,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:58:09,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:58:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:58:09,243 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 23 states. [2018-12-03 15:58:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:09,383 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-12-03 15:58:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:58:09,383 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-03 15:58:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:09,384 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:58:09,384 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:58:09,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 40 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:58:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:58:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:58:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:58:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 15:58:09,390 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2018-12-03 15:58:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:09,390 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 15:58:09,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:58:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 15:58:09,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:58:09,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:09,391 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-12-03 15:58:09,391 INFO L423 AbstractCegarLoop]: === Iteration 60 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:09,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1092475975, now seen corresponding path program 57 times [2018-12-03 15:58:09,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:09,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:09,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:09,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:09,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:09,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:09,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:09,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:09,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:09,630 INFO L192 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 [2018-12-03 15:58:09,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:09,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:09,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:09,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:09,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:09,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:10,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:10,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 15:58:10,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:10,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:58:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:58:10,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:58:10,062 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-03 15:58:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:10,129 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-03 15:58:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:58:10,130 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-03 15:58:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:10,131 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:58:10,131 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:58:10,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 40 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:58:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:58:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:58:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:58:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-03 15:58:10,134 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-12-03 15:58:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:10,134 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-03 15:58:10,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:58:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-03 15:58:10,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:58:10,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:10,135 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1] [2018-12-03 15:58:10,135 INFO L423 AbstractCegarLoop]: === Iteration 61 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:10,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:10,135 INFO L82 PathProgramCache]: Analyzing trace with hash -493044665, now seen corresponding path program 58 times [2018-12-03 15:58:10,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:10,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:10,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:10,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:10,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:10,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:10,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:10,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:10,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:10,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:10,531 INFO L192 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 [2018-12-03 15:58:10,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:10,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:10,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:10,580 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:10,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:10,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:10,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 15:58:10,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:10,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:58:10,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:58:10,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:58:10,622 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 23 states. [2018-12-03 15:58:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:11,299 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-03 15:58:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:58:11,300 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-12-03 15:58:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:11,301 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:58:11,301 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:58:11,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:58:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:58:11,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-12-03 15:58:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:58:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-03 15:58:11,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2018-12-03 15:58:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:11,307 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-03 15:58:11,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:58:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-03 15:58:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:58:11,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:11,307 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-12-03 15:58:11,308 INFO L423 AbstractCegarLoop]: === Iteration 62 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:11,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:11,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1895423047, now seen corresponding path program 59 times [2018-12-03 15:58:11,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:11,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:11,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:11,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:11,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:11,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:11,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:11,639 INFO L192 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 [2018-12-03 15:58:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:11,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:11,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:58:11,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:11,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:11,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:12,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 15:58:12,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:12,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:58:12,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:58:12,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:58:12,081 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 24 states. [2018-12-03 15:58:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:12,199 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 15:58:12,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:58:12,200 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 15:58:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:12,201 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:58:12,201 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:58:12,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 42 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:58:12,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:58:12,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:58:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:58:12,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-03 15:58:12,204 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 46 [2018-12-03 15:58:12,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:12,205 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-03 15:58:12,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:58:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-03 15:58:12,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:58:12,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:12,205 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-12-03 15:58:12,205 INFO L423 AbstractCegarLoop]: === Iteration 63 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:12,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:12,205 INFO L82 PathProgramCache]: Analyzing trace with hash 153247469, now seen corresponding path program 60 times [2018-12-03 15:58:12,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:12,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:12,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:12,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:12,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:12,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:12,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:12,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:12,610 INFO L192 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 [2018-12-03 15:58:12,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:12,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:12,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:12,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:12,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:13,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:13,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 15:58:13,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:13,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:58:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:58:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:58:13,051 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-03 15:58:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:13,122 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 15:58:13,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:58:13,123 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 15:58:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:13,124 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:58:13,124 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:58:13,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 42 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:58:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:58:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:58:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:58:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 15:58:13,128 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-12-03 15:58:13,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:13,128 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 15:58:13,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:58:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 15:58:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:58:13,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:13,129 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1] [2018-12-03 15:58:13,129 INFO L423 AbstractCegarLoop]: === Iteration 64 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:13,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash 455642721, now seen corresponding path program 61 times [2018-12-03 15:58:13,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:13,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:13,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:13,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:13,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:13,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:13,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:13,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:13,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:13,704 INFO L192 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 [2018-12-03 15:58:13,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:13,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:13,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:13,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:13,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 15:58:13,780 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:13,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:58:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:58:13,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:58:13,781 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 24 states. [2018-12-03 15:58:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:14,402 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-12-03 15:58:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:58:14,403 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-12-03 15:58:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:14,403 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:58:14,404 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:58:14,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:58:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:58:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-12-03 15:58:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:58:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-03 15:58:14,408 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2018-12-03 15:58:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:14,409 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-03 15:58:14,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:58:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-03 15:58:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:58:14,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:14,410 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-12-03 15:58:14,410 INFO L423 AbstractCegarLoop]: === Iteration 65 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:14,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:14,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1239960941, now seen corresponding path program 62 times [2018-12-03 15:58:14,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:14,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:14,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:14,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:14,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:14,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:14,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:14,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:14,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:14,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:14,640 INFO L192 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 [2018-12-03 15:58:14,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:14,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:14,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:58:14,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:14,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:14,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:15,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:15,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 15:58:15,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:15,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:58:15,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:58:15,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:58:15,125 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 25 states. [2018-12-03 15:58:15,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:15,283 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-12-03 15:58:15,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:58:15,283 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 15:58:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:15,284 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:58:15,284 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:58:15,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 44 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:58:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:58:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:58:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:58:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 15:58:15,289 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 48 [2018-12-03 15:58:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:15,289 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 15:58:15,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:58:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 15:58:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:58:15,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:15,289 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-12-03 15:58:15,290 INFO L423 AbstractCegarLoop]: === Iteration 66 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:15,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1227874425, now seen corresponding path program 63 times [2018-12-03 15:58:15,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:15,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:15,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:15,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:15,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:16,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:16,056 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:16,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:16,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:16,056 INFO L192 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 [2018-12-03 15:58:16,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:16,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:16,093 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:16,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:16,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:16,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 15:58:16,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:16,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:58:16,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:58:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:58:16,636 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-03 15:58:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:16,714 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-12-03 15:58:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:58:16,715 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 15:58:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:16,716 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:58:16,716 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:58:16,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 44 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:58:16,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:58:16,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:58:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:58:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-12-03 15:58:16,720 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2018-12-03 15:58:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:16,720 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-12-03 15:58:16,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:58:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-12-03 15:58:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:58:16,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:16,720 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1] [2018-12-03 15:58:16,720 INFO L423 AbstractCegarLoop]: === Iteration 67 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:16,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 590536967, now seen corresponding path program 64 times [2018-12-03 15:58:16,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:16,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:16,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:16,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:17,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:17,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:17,067 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:17,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:17,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:17,067 INFO L192 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 [2018-12-03 15:58:17,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:17,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:17,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:17,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:17,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:17,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 15:58:17,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:17,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:58:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:58:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:58:17,149 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 25 states. [2018-12-03 15:58:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:17,826 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 15:58:17,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:58:17,827 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-12-03 15:58:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:17,827 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:58:17,828 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:58:17,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:58:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:58:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-12-03 15:58:17,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:58:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 15:58:17,833 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2018-12-03 15:58:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:17,833 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 15:58:17,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:58:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 15:58:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:58:17,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:17,834 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-12-03 15:58:17,834 INFO L423 AbstractCegarLoop]: === Iteration 68 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:17,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1126715271, now seen corresponding path program 65 times [2018-12-03 15:58:17,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:17,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:17,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:17,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:18,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:18,070 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:18,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:18,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:18,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:18,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:18,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:18,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:58:18,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:18,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:18,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:18,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 15:58:18,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:18,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:58:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:58:18,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:58:18,682 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-12-03 15:58:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:18,865 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-03 15:58:18,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:58:18,866 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 15:58:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:18,866 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:58:18,866 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:58:18,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 75 SyntacticMatches, 46 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:58:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:58:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:58:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:58:18,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 15:58:18,871 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 50 [2018-12-03 15:58:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:18,872 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 15:58:18,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:58:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 15:58:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:58:18,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:18,872 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-12-03 15:58:18,873 INFO L423 AbstractCegarLoop]: === Iteration 69 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:18,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1933230253, now seen corresponding path program 66 times [2018-12-03 15:58:18,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:18,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:18,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:18,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:18,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:19,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:19,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:19,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:19,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:19,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:19,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:19,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:19,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:19,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:19,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:19,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:19,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:19,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:19,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 15:58:19,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:19,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:58:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:58:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:58:19,645 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-03 15:58:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:19,827 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-03 15:58:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:58:19,827 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 15:58:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:19,828 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:58:19,828 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:58:19,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 75 SyntacticMatches, 46 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:58:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:58:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:58:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:58:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 15:58:19,833 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 15:58:19,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:19,833 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 15:58:19,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:58:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 15:58:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:58:19,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:19,833 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1] [2018-12-03 15:58:19,834 INFO L423 AbstractCegarLoop]: === Iteration 70 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:19,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash -199465823, now seen corresponding path program 67 times [2018-12-03 15:58:19,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:19,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:19,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:19,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:19,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:20,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:20,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:20,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:20,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:20,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:20,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:20,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:20,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:20,629 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:20,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 15:58:20,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:20,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:58:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:58:20,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:58:20,711 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 26 states. [2018-12-03 15:58:21,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:21,681 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-12-03 15:58:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:58:21,681 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-12-03 15:58:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:21,682 INFO L225 Difference]: With dead ends: 80 [2018-12-03 15:58:21,682 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 15:58:21,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:58:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 15:58:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-12-03 15:58:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:58:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-03 15:58:21,687 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2018-12-03 15:58:21,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:21,687 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-03 15:58:21,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:58:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-03 15:58:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:58:21,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:21,688 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-12-03 15:58:21,688 INFO L423 AbstractCegarLoop]: === Iteration 71 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:21,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:21,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1888534739, now seen corresponding path program 68 times [2018-12-03 15:58:21,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:21,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:21,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:21,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:21,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:21,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:21,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:21,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:21,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:21,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:21,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:21,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:22,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:58:22,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:22,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:22,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:22,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:22,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 15:58:22,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:22,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:58:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:58:22,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:58:22,517 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 27 states. [2018-12-03 15:58:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:22,721 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-12-03 15:58:22,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:58:22,722 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 15:58:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:22,723 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:58:22,723 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:58:22,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 78 SyntacticMatches, 48 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:58:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:58:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:58:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:58:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-03 15:58:22,727 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 52 [2018-12-03 15:58:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:22,727 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-03 15:58:22,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:58:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-03 15:58:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:58:22,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:22,727 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-12-03 15:58:22,727 INFO L423 AbstractCegarLoop]: === Iteration 72 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:22,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:22,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1638593223, now seen corresponding path program 69 times [2018-12-03 15:58:22,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:22,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:22,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:22,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:23,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:23,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:23,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:23,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:23,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:23,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:23,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:23,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:23,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:23,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:23,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 15:58:23,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:23,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:58:23,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:58:23,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:58:23,600 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-03 15:58:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:23,674 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 15:58:23,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:58:23,675 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 15:58:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:23,676 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:58:23,676 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:58:23,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 78 SyntacticMatches, 48 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:58:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:58:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:58:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:58:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-03 15:58:23,679 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2018-12-03 15:58:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:23,680 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-03 15:58:23,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:58:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-03 15:58:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:58:23,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:23,680 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1] [2018-12-03 15:58:23,680 INFO L423 AbstractCegarLoop]: === Iteration 73 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:23,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:23,680 INFO L82 PathProgramCache]: Analyzing trace with hash -743279161, now seen corresponding path program 70 times [2018-12-03 15:58:23,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:23,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:23,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:24,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:24,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:24,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:24,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:24,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:24,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:24,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:24,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:24,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:24,185 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:24,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:24,216 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:24,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:24,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 15:58:24,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:24,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:58:24,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:58:24,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:58:24,244 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 27 states. [2018-12-03 15:58:25,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:25,085 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-12-03 15:58:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:58:25,085 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-12-03 15:58:25,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:25,086 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:58:25,086 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:58:25,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:58:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:58:25,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2018-12-03 15:58:25,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:58:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 15:58:25,091 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2018-12-03 15:58:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:25,092 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 15:58:25,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:58:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 15:58:25,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:58:25,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:25,093 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-12-03 15:58:25,093 INFO L423 AbstractCegarLoop]: === Iteration 74 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:25,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:25,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1566879033, now seen corresponding path program 71 times [2018-12-03 15:58:25,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:25,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:25,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:25,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:25,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:25,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:25,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:25,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:25,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:25,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:25,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:58:25,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:25,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:25,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:26,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:26,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 15:58:26,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:26,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:58:26,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:58:26,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:58:26,855 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 28 states. [2018-12-03 15:58:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:27,064 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-12-03 15:58:27,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:58:27,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 15:58:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:27,065 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:58:27,066 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:58:27,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 81 SyntacticMatches, 50 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:58:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:58:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:58:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:58:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 15:58:27,070 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 54 [2018-12-03 15:58:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:27,071 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 15:58:27,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:58:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 15:58:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:58:27,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:27,071 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-12-03 15:58:27,072 INFO L423 AbstractCegarLoop]: === Iteration 75 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:27,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash 399905389, now seen corresponding path program 72 times [2018-12-03 15:58:27,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:27,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:27,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:27,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:27,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:27,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:27,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:27,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:27,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:27,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:27,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:27,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:27,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:27,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:27,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:27,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:27,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:27,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:27,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 15:58:27,946 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:27,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:58:27,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:58:27,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:58:27,947 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-03 15:58:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:28,027 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-03 15:58:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:58:28,027 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 15:58:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:28,028 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:58:28,028 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:58:28,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 81 SyntacticMatches, 50 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:58:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:58:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 15:58:28,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:58:28,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-03 15:58:28,033 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-12-03 15:58:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:28,033 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-03 15:58:28,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:58:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-03 15:58:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:58:28,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:28,034 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1] [2018-12-03 15:58:28,034 INFO L423 AbstractCegarLoop]: === Iteration 76 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:28,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -487896351, now seen corresponding path program 73 times [2018-12-03 15:58:28,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:28,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:28,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:28,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:28,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:28,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:28,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:28,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:28,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:28,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:28,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:28,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:28,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:28,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:28,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:28,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:28,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 15:58:28,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:28,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:58:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:58:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:58:28,705 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 28 states. [2018-12-03 15:58:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:29,754 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-12-03 15:58:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:58:29,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-12-03 15:58:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:29,755 INFO L225 Difference]: With dead ends: 86 [2018-12-03 15:58:29,755 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:58:29,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:58:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:58:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2018-12-03 15:58:29,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:58:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-03 15:58:29,763 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2018-12-03 15:58:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:29,763 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-03 15:58:29,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:58:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-03 15:58:29,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:58:29,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:29,764 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-12-03 15:58:29,764 INFO L423 AbstractCegarLoop]: === Iteration 77 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:29,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:29,764 INFO L82 PathProgramCache]: Analyzing trace with hash 2055020781, now seen corresponding path program 74 times [2018-12-03 15:58:29,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:29,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:29,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:29,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:29,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:30,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:30,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:30,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:30,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:30,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:30,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:30,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:30,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:30,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:58:30,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:30,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:30,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:30,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:30,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 15:58:30,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:30,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:58:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:58:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:58:30,873 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 29 states. [2018-12-03 15:58:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:31,202 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-12-03 15:58:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:58:31,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-03 15:58:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:31,203 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:58:31,203 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:58:31,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 84 SyntacticMatches, 52 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:58:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:58:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:58:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:58:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 15:58:31,207 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 56 [2018-12-03 15:58:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:31,207 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 15:58:31,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:58:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 15:58:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:58:31,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:31,208 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-12-03 15:58:31,208 INFO L423 AbstractCegarLoop]: === Iteration 78 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:31,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1399171577, now seen corresponding path program 75 times [2018-12-03 15:58:31,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:31,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:31,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:31,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:31,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:31,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:31,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:31,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:31,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:31,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:31,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:31,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:31,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:31,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:31,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:31,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:32,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:32,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 15:58:32,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:32,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:58:32,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:58:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:58:32,271 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-03 15:58:33,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:33,024 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-03 15:58:33,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:58:33,024 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-03 15:58:33,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:33,025 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:58:33,025 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:58:33,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 84 SyntacticMatches, 52 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:58:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:58:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:58:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:58:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-03 15:58:33,030 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-12-03 15:58:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:33,030 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-03 15:58:33,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:58:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-03 15:58:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:58:33,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:33,031 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1] [2018-12-03 15:58:33,031 INFO L423 AbstractCegarLoop]: === Iteration 79 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:33,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:33,031 INFO L82 PathProgramCache]: Analyzing trace with hash -424707449, now seen corresponding path program 76 times [2018-12-03 15:58:33,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:33,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:33,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:33,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:33,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:33,513 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:33,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:33,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:33,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:33,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:33,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:33,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:33,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 15:58:33,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:33,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:58:33,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:58:33,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:58:33,716 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 29 states. [2018-12-03 15:58:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:34,674 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-12-03 15:58:34,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:58:34,674 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-12-03 15:58:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:34,675 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:58:34,675 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 15:58:34,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:58:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 15:58:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-12-03 15:58:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:58:34,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 15:58:34,681 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2018-12-03 15:58:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:34,681 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 15:58:34,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:58:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 15:58:34,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:58:34,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:34,682 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-12-03 15:58:34,682 INFO L423 AbstractCegarLoop]: === Iteration 80 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:34,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:34,682 INFO L82 PathProgramCache]: Analyzing trace with hash -281090553, now seen corresponding path program 77 times [2018-12-03 15:58:34,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:34,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:34,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:34,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:34,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:35,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:35,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:35,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:35,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:35,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:35,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:35,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:35,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:35,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:58:35,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:35,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:35,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:36,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:36,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 15:58:36,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:36,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:58:36,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:58:36,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:58:36,754 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 30 states. [2018-12-03 15:58:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:36,997 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-12-03 15:58:36,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:58:36,998 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 15:58:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:36,998 INFO L225 Difference]: With dead ends: 90 [2018-12-03 15:58:36,999 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:58:36,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 87 SyntacticMatches, 54 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:58:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:58:37,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:58:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:58:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-03 15:58:37,004 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 58 [2018-12-03 15:58:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:37,005 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-03 15:58:37,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:58:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-03 15:58:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:58:37,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:37,005 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-12-03 15:58:37,006 INFO L423 AbstractCegarLoop]: === Iteration 81 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:37,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:37,006 INFO L82 PathProgramCache]: Analyzing trace with hash 13128749, now seen corresponding path program 78 times [2018-12-03 15:58:37,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:37,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:37,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:37,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:37,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:37,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:37,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:37,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:37,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:37,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:37,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:37,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:37,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:37,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:37,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:37,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:37,434 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:37,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:38,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 15:58:38,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:38,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:58:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:58:38,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:58:38,043 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-03 15:58:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:38,124 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 15:58:38,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:58:38,124 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 15:58:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:38,125 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:58:38,125 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:58:38,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 87 SyntacticMatches, 54 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:58:38,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:58:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:58:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:58:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 15:58:38,130 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-12-03 15:58:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:38,130 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 15:58:38,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:58:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 15:58:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:58:38,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:38,131 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1] [2018-12-03 15:58:38,131 INFO L423 AbstractCegarLoop]: === Iteration 82 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:38,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash 406929697, now seen corresponding path program 79 times [2018-12-03 15:58:38,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:38,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:38,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:38,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:38,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:38,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:38,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:38,820 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:38,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:38,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:38,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:38,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:38,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:38,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:38,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:38,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:38,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 15:58:38,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:38,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:58:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:58:38,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:58:38,909 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2018-12-03 15:58:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:40,090 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 15:58:40,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:58:40,091 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2018-12-03 15:58:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:40,092 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:58:40,092 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:58:40,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:58:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:58:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-12-03 15:58:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:58:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 15:58:40,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2018-12-03 15:58:40,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:40,098 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 15:58:40,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:58:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 15:58:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:58:40,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:40,098 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-12-03 15:58:40,099 INFO L423 AbstractCegarLoop]: === Iteration 83 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:40,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash -270142803, now seen corresponding path program 80 times [2018-12-03 15:58:40,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:40,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:40,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:40,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:40,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:40,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:40,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:40,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:40,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:40,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:40,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:40,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:58:40,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:40,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:41,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:41,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 15:58:41,087 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:41,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:58:41,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:58:41,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:58:41,088 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 31 states. [2018-12-03 15:58:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:41,356 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-12-03 15:58:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:58:41,356 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 15:58:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:41,357 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:58:41,357 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:58:41,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 90 SyntacticMatches, 56 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:58:41,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:58:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:58:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:58:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 15:58:41,362 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 60 [2018-12-03 15:58:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:41,362 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 15:58:41,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:58:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 15:58:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:58:41,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:41,363 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-12-03 15:58:41,363 INFO L423 AbstractCegarLoop]: === Iteration 84 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:41,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash 260720967, now seen corresponding path program 81 times [2018-12-03 15:58:41,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:41,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:41,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:42,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:42,106 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:42,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:42,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:42,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:42,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:42,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:42,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:42,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:42,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:42,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 15:58:42,780 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:42,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:58:42,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:58:42,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:58:42,781 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-03 15:58:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:42,920 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-12-03 15:58:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:58:42,921 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 15:58:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:42,921 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:58:42,921 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:58:42,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 90 SyntacticMatches, 56 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:58:42,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:58:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:58:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:58:42,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-12-03 15:58:42,926 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2018-12-03 15:58:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:42,926 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-12-03 15:58:42,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:58:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-12-03 15:58:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 15:58:42,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:42,926 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1] [2018-12-03 15:58:42,927 INFO L423 AbstractCegarLoop]: === Iteration 85 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:42,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash -507646137, now seen corresponding path program 82 times [2018-12-03 15:58:42,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:42,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:42,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:42,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:43,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:43,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:43,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:43,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:43,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:43,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:43,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:43,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:43,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:43,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:43,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:43,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 15:58:43,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:43,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:58:43,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:58:43,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:58:43,654 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 31 states. [2018-12-03 15:58:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:45,297 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-12-03 15:58:45,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:58:45,298 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-12-03 15:58:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:45,299 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:58:45,299 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:58:45,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:58:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:58:45,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-12-03 15:58:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:58:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-12-03 15:58:45,305 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2018-12-03 15:58:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:45,305 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-12-03 15:58:45,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:58:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-12-03 15:58:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:58:45,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:45,306 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-12-03 15:58:45,307 INFO L423 AbstractCegarLoop]: === Iteration 86 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:45,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:45,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1442777415, now seen corresponding path program 83 times [2018-12-03 15:58:45,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:45,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:45,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:45,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:46,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:46,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:46,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:46,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:46,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:46,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:58:46,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:46,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:46,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:47,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:47,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 15:58:47,252 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:47,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:58:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:58:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:58:47,253 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 32 states. [2018-12-03 15:58:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:47,449 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-12-03 15:58:47,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:58:47,449 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 15:58:47,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:47,450 INFO L225 Difference]: With dead ends: 96 [2018-12-03 15:58:47,450 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:58:47,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 93 SyntacticMatches, 58 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:58:47,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:58:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:58:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:58:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 15:58:47,455 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 62 [2018-12-03 15:58:47,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:47,456 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 15:58:47,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:58:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 15:58:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:58:47,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:47,456 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-12-03 15:58:47,457 INFO L423 AbstractCegarLoop]: === Iteration 87 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:47,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash 719685101, now seen corresponding path program 84 times [2018-12-03 15:58:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:47,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:48,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:48,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:48,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:48,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:48,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:48,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:48,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:48,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:48,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:48,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:48,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:48,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 15:58:48,716 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:48,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:58:48,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:58:48,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:58:48,717 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-03 15:58:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:48,809 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-03 15:58:48,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:58:48,810 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 15:58:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:48,811 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:58:48,811 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:58:48,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 93 SyntacticMatches, 58 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:58:48,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:58:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:58:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:58:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 15:58:48,815 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 15:58:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:48,815 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 15:58:48,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:58:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 15:58:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:58:48,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:48,816 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1] [2018-12-03 15:58:48,816 INFO L423 AbstractCegarLoop]: === Iteration 88 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:48,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 835340129, now seen corresponding path program 85 times [2018-12-03 15:58:48,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:48,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:48,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:49,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:49,391 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:49,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:49,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:49,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:49,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:49,400 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:49,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:49,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:49,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 15:58:49,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:49,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:58:49,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:58:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:58:49,506 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 32 states. [2018-12-03 15:58:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:50,647 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-12-03 15:58:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:58:50,648 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2018-12-03 15:58:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:50,649 INFO L225 Difference]: With dead ends: 98 [2018-12-03 15:58:50,649 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:58:50,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:58:50,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:58:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2018-12-03 15:58:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:58:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 15:58:50,656 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2018-12-03 15:58:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:50,656 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 15:58:50,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:58:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 15:58:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:58:50,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:50,657 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-12-03 15:58:50,657 INFO L423 AbstractCegarLoop]: === Iteration 89 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:50,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash 125678701, now seen corresponding path program 86 times [2018-12-03 15:58:50,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:50,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:50,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:50,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:50,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:51,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:51,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:51,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:51,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:51,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:51,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:51,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:51,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:51,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:58:51,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:51,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:51,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:52,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:52,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 15:58:52,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:52,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:58:52,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:58:52,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:58:52,310 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 33 states. [2018-12-03 15:58:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:52,601 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-12-03 15:58:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:58:52,601 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 15:58:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:52,602 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:58:52,602 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:58:52,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 96 SyntacticMatches, 60 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:58:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:58:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 15:58:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:58:52,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-03 15:58:52,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 64 [2018-12-03 15:58:52,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:52,607 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-03 15:58:52,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:58:52,607 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-03 15:58:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:58:52,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:52,608 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-12-03 15:58:52,608 INFO L423 AbstractCegarLoop]: === Iteration 90 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:52,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:52,608 INFO L82 PathProgramCache]: Analyzing trace with hash -815346553, now seen corresponding path program 87 times [2018-12-03 15:58:52,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:53,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:53,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:53,056 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:53,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:53,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:53,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:53,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:53,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:53,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:53,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:53,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:53,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:53,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:53,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 15:58:53,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:53,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:58:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:58:53,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:58:53,873 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-03 15:58:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:53,963 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-12-03 15:58:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:58:53,964 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 15:58:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:53,964 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:58:53,964 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:58:53,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 96 SyntacticMatches, 60 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:58:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:58:53,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:58:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:58:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-03 15:58:53,970 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2018-12-03 15:58:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:53,970 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-03 15:58:53,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:58:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-03 15:58:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:58:53,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:53,970 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1] [2018-12-03 15:58:53,970 INFO L423 AbstractCegarLoop]: === Iteration 91 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:53,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash 493999111, now seen corresponding path program 88 times [2018-12-03 15:58:53,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:53,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:53,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:53,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:53,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:54,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:54,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:54,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:54,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:54,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:54,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:54,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:54,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:54,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:54,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:54,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:54,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 15:58:54,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:54,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:58:54,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:58:54,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:58:54,672 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 33 states. [2018-12-03 15:58:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:55,943 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-12-03 15:58:55,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:58:55,944 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2018-12-03 15:58:55,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:55,945 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:58:55,945 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:58:55,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:58:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:58:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2018-12-03 15:58:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:58:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-03 15:58:55,950 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2018-12-03 15:58:55,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:55,950 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-03 15:58:55,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:58:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-03 15:58:55,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:58:55,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:55,951 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-12-03 15:58:55,951 INFO L423 AbstractCegarLoop]: === Iteration 92 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:55,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1865958265, now seen corresponding path program 89 times [2018-12-03 15:58:55,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:55,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:55,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:56,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:56,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:56,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:56,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:56,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:56,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:58:56,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:56,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:56,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:57,581 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:57,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:57,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 15:58:57,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:57,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:58:57,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:58:57,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:58:57,601 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 34 states. [2018-12-03 15:58:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:57,916 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 15:58:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:58:57,916 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 15:58:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:57,917 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:58:57,917 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:58:57,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 99 SyntacticMatches, 62 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:58:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:58:57,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:58:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:58:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 15:58:57,922 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 66 [2018-12-03 15:58:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:57,922 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 15:58:57,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:58:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 15:58:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:58:57,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:57,923 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-12-03 15:58:57,923 INFO L423 AbstractCegarLoop]: === Iteration 93 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:57,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:57,923 INFO L82 PathProgramCache]: Analyzing trace with hash -972970067, now seen corresponding path program 90 times [2018-12-03 15:58:57,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:57,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:57,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:57,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:57,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:58,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:58,349 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:58,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:58,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:58,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:58,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:58,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:58,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:58,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:58,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:58,408 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:59,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:59,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 15:58:59,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:59,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:58:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:58:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:58:59,194 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-03 15:58:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:59,286 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-12-03 15:58:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:58:59,286 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 15:58:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:59,287 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:58:59,287 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:58:59,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 99 SyntacticMatches, 62 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:58:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:58:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:58:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:58:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-12-03 15:58:59,292 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2018-12-03 15:58:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:59,292 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-12-03 15:58:59,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:58:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-12-03 15:58:59,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:58:59,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:59,292 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1] [2018-12-03 15:58:59,292 INFO L423 AbstractCegarLoop]: === Iteration 94 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:59,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash -97362527, now seen corresponding path program 91 times [2018-12-03 15:58:59,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:59,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:59,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:59,898 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:59,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:59,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:59,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:59,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:59,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:59,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:59,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:59,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:59,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:00,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 15:59:00,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:00,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:59:00,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:59:00,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:59:00,127 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 34 states. [2018-12-03 15:59:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:01,561 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-12-03 15:59:01,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:59:01,561 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-12-03 15:59:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:01,562 INFO L225 Difference]: With dead ends: 104 [2018-12-03 15:59:01,562 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 15:59:01,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:59:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 15:59:01,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-12-03 15:59:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:59:01,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-03 15:59:01,568 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2018-12-03 15:59:01,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:01,569 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-03 15:59:01,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:59:01,569 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-03 15:59:01,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:59:01,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:01,569 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-12-03 15:59:01,569 INFO L423 AbstractCegarLoop]: === Iteration 95 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:01,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:01,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1276667437, now seen corresponding path program 92 times [2018-12-03 15:59:01,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:01,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:01,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:01,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:02,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:02,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:02,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:02,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:02,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:02,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:02,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:02,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:02,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:59:02,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:02,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:02,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:03,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:04,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 15:59:04,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:04,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:59:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:59:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:59:04,018 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 35 states. [2018-12-03 15:59:04,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:04,362 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-12-03 15:59:04,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:59:04,363 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-03 15:59:04,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:04,364 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:59:04,364 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:59:04,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 102 SyntacticMatches, 64 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:59:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:59:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 15:59:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:59:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 15:59:04,370 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 68 [2018-12-03 15:59:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:04,370 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 15:59:04,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:59:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 15:59:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:59:04,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:04,371 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-12-03 15:59:04,371 INFO L423 AbstractCegarLoop]: === Iteration 96 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:04,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:04,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1105469497, now seen corresponding path program 93 times [2018-12-03 15:59:04,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:04,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:04,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:04,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:04,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:04,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:04,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:04,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:04,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:04,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:04,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:05,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:05,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:05,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:05,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:05,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:05,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 15:59:05,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:05,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:59:05,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:59:05,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:59:05,899 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-03 15:59:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:06,005 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-12-03 15:59:06,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:59:06,005 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-03 15:59:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:06,006 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:59:06,006 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:59:06,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 102 SyntacticMatches, 64 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:59:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:59:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:59:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:59:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-03 15:59:06,013 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-12-03 15:59:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:06,013 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-03 15:59:06,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:59:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-03 15:59:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:59:06,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:06,014 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1] [2018-12-03 15:59:06,014 INFO L423 AbstractCegarLoop]: === Iteration 97 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:06,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash 90122439, now seen corresponding path program 94 times [2018-12-03 15:59:06,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:06,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:06,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:06,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:06,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:06,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:06,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:06,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:06,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:06,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:06,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:06,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:06,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 15:59:06,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:06,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:59:06,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:59:06,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:59:06,721 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 35 states. [2018-12-03 15:59:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:08,259 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-12-03 15:59:08,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:59:08,260 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2018-12-03 15:59:08,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:08,261 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:59:08,261 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:59:08,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:59:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:59:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2018-12-03 15:59:08,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:59:08,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-12-03 15:59:08,265 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2018-12-03 15:59:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:08,266 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-12-03 15:59:08,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:59:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-12-03 15:59:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:59:08,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:08,266 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-12-03 15:59:08,266 INFO L423 AbstractCegarLoop]: === Iteration 98 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:08,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:08,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1501233209, now seen corresponding path program 95 times [2018-12-03 15:59:08,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:08,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:08,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:08,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:08,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:08,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:08,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:08,720 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:08,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:08,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:08,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:08,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:08,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:08,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:59:08,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:08,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:08,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:09,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:09,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 15:59:09,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:09,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:59:09,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:59:09,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:59:09,598 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 36 states. [2018-12-03 15:59:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:09,957 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-12-03 15:59:09,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:59:09,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 15:59:09,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:09,959 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:59:09,959 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:59:09,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 105 SyntacticMatches, 66 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:59:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:59:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 15:59:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 15:59:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-03 15:59:09,965 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 70 [2018-12-03 15:59:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:09,965 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-03 15:59:09,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:59:09,965 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-03 15:59:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:59:09,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:09,966 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-12-03 15:59:09,966 INFO L423 AbstractCegarLoop]: === Iteration 99 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:09,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:09,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1961933165, now seen corresponding path program 96 times [2018-12-03 15:59:09,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:09,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:09,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:09,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:09,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:10,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:10,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:10,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:10,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:10,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:10,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:10,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:10,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:10,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:10,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:10,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:10,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:11,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:11,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 15:59:11,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:11,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:59:11,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:59:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:59:11,492 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-03 15:59:11,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:11,596 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 15:59:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:59:11,597 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 15:59:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:11,597 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:59:11,598 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 15:59:11,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 105 SyntacticMatches, 66 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:59:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 15:59:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 15:59:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:59:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 15:59:11,604 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2018-12-03 15:59:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:11,605 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 15:59:11,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:59:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 15:59:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:59:11,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:11,606 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1] [2018-12-03 15:59:11,606 INFO L423 AbstractCegarLoop]: === Iteration 100 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:11,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:11,606 INFO L82 PathProgramCache]: Analyzing trace with hash 690324449, now seen corresponding path program 97 times [2018-12-03 15:59:11,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:11,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:11,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:11,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:11,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:12,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:12,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:12,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:12,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:12,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:12,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:12,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:12,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:12,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:12,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:12,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:12,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:12,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 15:59:12,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:12,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:59:12,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:59:12,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:59:12,675 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 36 states. [2018-12-03 15:59:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:14,140 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-12-03 15:59:14,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:59:14,141 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2018-12-03 15:59:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:14,142 INFO L225 Difference]: With dead ends: 110 [2018-12-03 15:59:14,142 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:59:14,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:59:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:59:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2018-12-03 15:59:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:59:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-03 15:59:14,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2018-12-03 15:59:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:14,147 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-03 15:59:14,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:59:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-03 15:59:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:59:14,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:14,148 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-12-03 15:59:14,148 INFO L423 AbstractCegarLoop]: === Iteration 101 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:14,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:14,149 INFO L82 PathProgramCache]: Analyzing trace with hash -74840083, now seen corresponding path program 98 times [2018-12-03 15:59:14,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:14,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:14,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:14,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:14,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:14,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:14,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:14,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:14,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:14,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:14,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:14,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:14,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:59:14,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:14,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:14,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:15,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:15,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 15:59:15,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:15,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:59:15,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:59:15,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:59:15,521 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 37 states. [2018-12-03 15:59:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:15,894 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-12-03 15:59:15,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:59:15,894 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 15:59:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:15,895 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:59:15,895 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:59:15,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 108 SyntacticMatches, 68 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:59:15,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:59:15,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:59:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:59:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 15:59:15,902 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 72 [2018-12-03 15:59:15,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:15,902 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 15:59:15,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:59:15,903 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 15:59:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:59:15,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:15,903 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-12-03 15:59:15,904 INFO L423 AbstractCegarLoop]: === Iteration 102 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:15,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:15,904 INFO L82 PathProgramCache]: Analyzing trace with hash -90864889, now seen corresponding path program 99 times [2018-12-03 15:59:15,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:15,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:15,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:15,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:15,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:16,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:16,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:16,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:16,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:16,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:16,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:16,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:16,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:16,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:16,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:16,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:16,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:17,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:17,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 15:59:17,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:17,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:59:17,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:59:17,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:59:17,789 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-03 15:59:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:17,910 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-12-03 15:59:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:59:17,911 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 15:59:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:17,911 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:59:17,912 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:59:17,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 108 SyntacticMatches, 68 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:59:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:59:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:59:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:59:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-12-03 15:59:17,917 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2018-12-03 15:59:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:17,918 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-12-03 15:59:17,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:59:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-12-03 15:59:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:59:17,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:17,918 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1] [2018-12-03 15:59:17,918 INFO L423 AbstractCegarLoop]: === Iteration 103 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:17,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1478094215, now seen corresponding path program 100 times [2018-12-03 15:59:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:17,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:17,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:17,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:18,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:18,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:18,636 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:18,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:18,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:18,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:18,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:18,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:18,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:18,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:18,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:18,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 15:59:18,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:18,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:59:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:59:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:59:18,748 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 37 states. [2018-12-03 15:59:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:20,294 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-03 15:59:20,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:59:20,294 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2018-12-03 15:59:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:20,295 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:59:20,295 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:59:20,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:59:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:59:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2018-12-03 15:59:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:59:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-12-03 15:59:20,301 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2018-12-03 15:59:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:20,301 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-12-03 15:59:20,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:59:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-12-03 15:59:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:59:20,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:20,302 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-12-03 15:59:20,302 INFO L423 AbstractCegarLoop]: === Iteration 104 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:20,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1423781113, now seen corresponding path program 101 times [2018-12-03 15:59:20,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:20,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:20,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:20,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:21,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:21,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:21,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:21,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:21,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:21,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:21,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:21,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:21,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:59:21,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:21,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:21,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:22,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:22,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 15:59:22,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:22,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:59:22,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:59:22,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:59:22,173 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 38 states. [2018-12-03 15:59:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:22,586 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-12-03 15:59:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:59:22,586 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 15:59:22,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:22,587 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:59:22,588 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:59:22,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 111 SyntacticMatches, 70 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:59:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:59:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 15:59:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:59:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 15:59:22,594 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 74 [2018-12-03 15:59:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:22,594 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 15:59:22,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:59:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 15:59:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:59:22,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:22,595 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-12-03 15:59:22,595 INFO L423 AbstractCegarLoop]: === Iteration 105 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:22,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1920550099, now seen corresponding path program 102 times [2018-12-03 15:59:22,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:22,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:22,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:22,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:22,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:23,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:23,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:23,349 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:23,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:23,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:23,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:23,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:23,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:23,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:23,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:23,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:23,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:24,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 15:59:24,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:24,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:59:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:59:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:59:24,387 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-03 15:59:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:24,493 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-03 15:59:24,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:59:24,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 15:59:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:24,494 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:59:24,494 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:59:24,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 111 SyntacticMatches, 70 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:59:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:59:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:59:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:59:24,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 15:59:24,501 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 15:59:24,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:24,502 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 15:59:24,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:59:24,502 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 15:59:24,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:59:24,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:24,502 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1] [2018-12-03 15:59:24,503 INFO L423 AbstractCegarLoop]: === Iteration 106 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:24,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:24,503 INFO L82 PathProgramCache]: Analyzing trace with hash 592427553, now seen corresponding path program 103 times [2018-12-03 15:59:24,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:24,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:24,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:24,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:24,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:25,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:25,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:25,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:25,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:25,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:25,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:25,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:25,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:25,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:25,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:25,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:25,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:25,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 15:59:25,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:25,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:59:25,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:59:25,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:59:25,617 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 38 states. [2018-12-03 15:59:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:27,258 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-12-03 15:59:27,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:59:27,259 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 75 [2018-12-03 15:59:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:27,260 INFO L225 Difference]: With dead ends: 116 [2018-12-03 15:59:27,260 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:59:27,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:59:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:59:27,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2018-12-03 15:59:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:59:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-03 15:59:27,267 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2018-12-03 15:59:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:27,268 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-03 15:59:27,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:59:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-03 15:59:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:59:27,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:27,269 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-12-03 15:59:27,269 INFO L423 AbstractCegarLoop]: === Iteration 107 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:27,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:27,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1185323437, now seen corresponding path program 104 times [2018-12-03 15:59:27,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:27,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:27,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:28,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:28,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:28,072 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:28,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:28,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:28,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:28,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:28,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:28,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:59:28,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:28,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:28,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:29,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:29,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:29,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 15:59:29,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:29,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:59:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:59:29,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:59:29,244 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 39 states. [2018-12-03 15:59:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:29,556 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 15:59:29,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:59:29,562 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 15:59:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:29,562 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:59:29,562 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 15:59:29,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 114 SyntacticMatches, 72 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:59:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 15:59:29,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 15:59:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:59:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-03 15:59:29,568 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 76 [2018-12-03 15:59:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:29,568 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-03 15:59:29,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:59:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-03 15:59:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:59:29,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:29,569 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-12-03 15:59:29,569 INFO L423 AbstractCegarLoop]: === Iteration 108 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:29,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1329613241, now seen corresponding path program 105 times [2018-12-03 15:59:29,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:29,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:29,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:29,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:30,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:30,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:30,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:30,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:30,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:30,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:30,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:30,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:30,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:30,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:30,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:30,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:31,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:31,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 15:59:31,224 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:31,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:59:31,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:59:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:59:31,225 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-03 15:59:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:31,347 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-12-03 15:59:31,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:59:31,347 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 15:59:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:31,348 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:59:31,348 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:59:31,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 114 SyntacticMatches, 72 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:59:31,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:59:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 15:59:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:59:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-03 15:59:31,353 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2018-12-03 15:59:31,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:31,353 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-03 15:59:31,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:59:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-03 15:59:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:59:31,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:31,353 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1] [2018-12-03 15:59:31,353 INFO L423 AbstractCegarLoop]: === Iteration 109 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:31,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:31,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1731600967, now seen corresponding path program 106 times [2018-12-03 15:59:31,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:31,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:31,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:31,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:31,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:32,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:32,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:32,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:32,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:32,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:32,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:32,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:32,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:32,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:32,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:32,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:32,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:32,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 15:59:32,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:32,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:59:32,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:59:32,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:59:32,232 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 39 states. [2018-12-03 15:59:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:34,129 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-12-03 15:59:34,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:59:34,130 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2018-12-03 15:59:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:34,130 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:59:34,130 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:59:34,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:59:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:59:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2018-12-03 15:59:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:59:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 15:59:34,136 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2018-12-03 15:59:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:34,136 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 15:59:34,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:59:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 15:59:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:59:34,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:34,137 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-12-03 15:59:34,137 INFO L423 AbstractCegarLoop]: === Iteration 110 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:34,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2139960903, now seen corresponding path program 107 times [2018-12-03 15:59:34,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:34,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:34,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:34,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:34,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:34,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:34,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:34,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:34,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:34,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:34,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:34,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:59:34,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:34,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:34,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:36,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:36,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 15:59:36,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:36,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:59:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:59:36,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:59:36,009 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 40 states. [2018-12-03 15:59:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:36,448 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-12-03 15:59:36,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:59:36,448 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 15:59:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:36,449 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:59:36,449 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:59:36,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 117 SyntacticMatches, 74 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:59:36,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:59:36,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:59:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:59:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 15:59:36,455 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 78 [2018-12-03 15:59:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:36,455 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 15:59:36,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:59:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 15:59:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:59:36,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:36,456 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-12-03 15:59:36,456 INFO L423 AbstractCegarLoop]: === Iteration 111 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:36,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:36,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1486335213, now seen corresponding path program 108 times [2018-12-03 15:59:36,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:36,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:36,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:36,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:37,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:37,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:37,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:37,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:37,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:37,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:37,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:37,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:37,101 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:37,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:37,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:37,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:38,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:38,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 15:59:38,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:38,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:59:38,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:59:38,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:59:38,488 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-03 15:59:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:38,601 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-12-03 15:59:38,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:59:38,602 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 15:59:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:38,602 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:59:38,602 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:59:38,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 117 SyntacticMatches, 74 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:59:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:59:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 15:59:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:59:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-12-03 15:59:38,609 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2018-12-03 15:59:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:38,609 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-12-03 15:59:38,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:59:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-12-03 15:59:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:59:38,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:38,610 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1] [2018-12-03 15:59:38,610 INFO L423 AbstractCegarLoop]: === Iteration 112 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:38,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1168310175, now seen corresponding path program 109 times [2018-12-03 15:59:38,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:38,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:38,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:38,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:38,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:39,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:39,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:39,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:39,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:39,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:39,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:39,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:39,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:39,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:39,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 15:59:39,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:39,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:59:39,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:59:39,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:59:39,545 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 40 states. [2018-12-03 15:59:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:41,387 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-12-03 15:59:41,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:59:41,388 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 79 [2018-12-03 15:59:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:41,389 INFO L225 Difference]: With dead ends: 122 [2018-12-03 15:59:41,389 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 15:59:41,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:59:41,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 15:59:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2018-12-03 15:59:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:59:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-03 15:59:41,396 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2018-12-03 15:59:41,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:41,397 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-03 15:59:41,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:59:41,397 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-03 15:59:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:59:41,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:41,397 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-12-03 15:59:41,398 INFO L423 AbstractCegarLoop]: === Iteration 113 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:41,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1857938579, now seen corresponding path program 110 times [2018-12-03 15:59:41,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:41,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:41,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:41,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:41,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:41,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:41,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:41,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:41,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:42,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:59:42,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:42,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:42,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:43,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:43,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 15:59:43,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:43,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:59:43,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:59:43,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:59:43,324 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 41 states. [2018-12-03 15:59:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:43,787 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-12-03 15:59:43,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:59:43,788 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-03 15:59:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:43,789 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:59:43,789 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 15:59:43,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 120 SyntacticMatches, 76 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:59:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 15:59:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 15:59:43,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:59:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 15:59:43,794 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 80 [2018-12-03 15:59:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:43,794 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 15:59:43,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:59:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 15:59:43,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:59:43,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:43,795 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-12-03 15:59:43,795 INFO L423 AbstractCegarLoop]: === Iteration 114 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:43,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:43,795 INFO L82 PathProgramCache]: Analyzing trace with hash -645498489, now seen corresponding path program 111 times [2018-12-03 15:59:43,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:43,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:43,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:43,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:44,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:44,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:44,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:44,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:44,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:44,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:44,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:44,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:44,476 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:44,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:44,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:44,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:45,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:45,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 15:59:45,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:45,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:59:45,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:59:45,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:59:45,587 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-03 15:59:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:45,721 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-12-03 15:59:45,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:59:45,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-03 15:59:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:45,722 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:59:45,722 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:59:45,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 120 SyntacticMatches, 76 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:59:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:59:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:59:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:59:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-12-03 15:59:45,728 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-12-03 15:59:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:45,728 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-12-03 15:59:45,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:59:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-12-03 15:59:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:59:45,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:45,729 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1] [2018-12-03 15:59:45,729 INFO L423 AbstractCegarLoop]: === Iteration 115 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:45,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:45,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1464321799, now seen corresponding path program 112 times [2018-12-03 15:59:45,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:45,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:45,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:46,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:46,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:46,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:46,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:46,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:46,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:46,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:46,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:46,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:46,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:46,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 15:59:46,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:46,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:59:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:59:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:59:46,713 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 41 states. [2018-12-03 15:59:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:48,761 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-12-03 15:59:48,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:59:48,761 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 81 [2018-12-03 15:59:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:48,762 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:59:48,762 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 15:59:48,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 195 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:59:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 15:59:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2018-12-03 15:59:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:59:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-03 15:59:48,768 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2018-12-03 15:59:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:48,768 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-03 15:59:48,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:59:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-03 15:59:48,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:59:48,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:48,768 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-12-03 15:59:48,769 INFO L423 AbstractCegarLoop]: === Iteration 116 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:48,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:48,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1850726009, now seen corresponding path program 113 times [2018-12-03 15:59:48,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:48,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:48,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:48,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:48,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:49,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:49,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:49,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:49,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:49,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:49,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 15:59:49,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:49,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:49,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:50,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 15:59:50,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:50,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:59:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:59:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:59:50,563 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 42 states. [2018-12-03 15:59:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:51,045 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-12-03 15:59:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:59:51,046 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 15:59:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:51,046 INFO L225 Difference]: With dead ends: 126 [2018-12-03 15:59:51,047 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:59:51,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 123 SyntacticMatches, 78 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:59:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:59:51,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 15:59:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:59:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-03 15:59:51,054 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 82 [2018-12-03 15:59:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:51,054 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-03 15:59:51,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:59:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-03 15:59:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:59:51,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:51,055 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-12-03 15:59:51,055 INFO L423 AbstractCegarLoop]: === Iteration 117 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:51,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:51,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1375178413, now seen corresponding path program 114 times [2018-12-03 15:59:51,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:51,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:51,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:51,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:51,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:51,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:51,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:51,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:51,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:51,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:51,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:51,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:51,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:51,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:51,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:51,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:52,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:52,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:52,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 15:59:52,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:59:52,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:59:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:59:52,950 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-03 15:59:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:53,144 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 15:59:53,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:59:53,144 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 15:59:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:53,145 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:59:53,145 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:59:53,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 123 SyntacticMatches, 78 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:59:53,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:59:53,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:59:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:59:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 15:59:53,150 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2018-12-03 15:59:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:53,151 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 15:59:53,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:59:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 15:59:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:59:53,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:53,151 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1] [2018-12-03 15:59:53,152 INFO L423 AbstractCegarLoop]: === Iteration 118 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:53,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -319203679, now seen corresponding path program 115 times [2018-12-03 15:59:53,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:53,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:53,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:53,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:54,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:54,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:54,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:54,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:54,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:54,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:54,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:54,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:54,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:54,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:54,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:54,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 15:59:54,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:54,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:59:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:59:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:59:54,176 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states. [2018-12-03 15:59:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:56,201 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-12-03 15:59:56,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:59:56,201 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2018-12-03 15:59:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:56,202 INFO L225 Difference]: With dead ends: 128 [2018-12-03 15:59:56,202 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 15:59:56,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:59:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 15:59:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2018-12-03 15:59:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 15:59:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-03 15:59:56,209 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2018-12-03 15:59:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:56,209 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-03 15:59:56,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:59:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-03 15:59:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:59:56,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:56,209 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-12-03 15:59:56,210 INFO L423 AbstractCegarLoop]: === Iteration 119 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:56,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1305440979, now seen corresponding path program 116 times [2018-12-03 15:59:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:56,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:56,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:56,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:56,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:56,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:56,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:56,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:56,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:56,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 15:59:56,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:56,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:56,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 15:59:58,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:59:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:59:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:59:58,400 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 43 states. [2018-12-03 15:59:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:58,913 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-12-03 15:59:58,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:59:58,914 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 15:59:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:58,914 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:59:58,914 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:59:58,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 126 SyntacticMatches, 80 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:59:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:59:58,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:59:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:59:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 15:59:58,921 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 84 [2018-12-03 15:59:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:58,922 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 15:59:58,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:59:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 15:59:58,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:59:58,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:58,922 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-12-03 15:59:58,923 INFO L423 AbstractCegarLoop]: === Iteration 120 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:58,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash -86651705, now seen corresponding path program 117 times [2018-12-03 15:59:58,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:58,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:58,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:59,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:59,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:59,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:59,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:59,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:59,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:59,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:59,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:59,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:59,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:59,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:59,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:01,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:01,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 16:00:01,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:01,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:00:01,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:00:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:00:01,058 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-03 16:00:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:01,196 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-12-03 16:00:01,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:00:01,196 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 16:00:01,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:01,197 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:00:01,197 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:00:01,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 126 SyntacticMatches, 80 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:00:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:00:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:00:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:00:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-12-03 16:00:01,203 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2018-12-03 16:00:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:01,204 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-12-03 16:00:01,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:00:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-12-03 16:00:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:00:01,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:01,204 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1] [2018-12-03 16:00:01,205 INFO L423 AbstractCegarLoop]: === Iteration 121 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:01,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:01,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1608702919, now seen corresponding path program 118 times [2018-12-03 16:00:01,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:01,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:01,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:01,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:01,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:02,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:02,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:02,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:02,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:02,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:02,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:02,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:02,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:02,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:02,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:02,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:02,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 16:00:02,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:02,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:00:02,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:00:02,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:00:02,281 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 43 states. [2018-12-03 16:00:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:04,574 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-12-03 16:00:04,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:00:04,574 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2018-12-03 16:00:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:04,575 INFO L225 Difference]: With dead ends: 131 [2018-12-03 16:00:04,575 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 16:00:04,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:00:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 16:00:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2018-12-03 16:00:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:00:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-12-03 16:00:04,583 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2018-12-03 16:00:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:04,584 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-12-03 16:00:04,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:00:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-12-03 16:00:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:00:04,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:04,584 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-12-03 16:00:04,585 INFO L423 AbstractCegarLoop]: === Iteration 122 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:04,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1669878585, now seen corresponding path program 119 times [2018-12-03 16:00:04,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:04,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:04,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:04,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:05,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:05,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:05,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:05,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:05,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:05,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:05,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:05,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:05,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:00:05,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:05,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:05,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:06,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:06,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 16:00:06,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:06,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:00:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:00:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:00:06,680 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 44 states. [2018-12-03 16:00:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:07,038 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 16:00:07,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:00:07,038 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 16:00:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:07,039 INFO L225 Difference]: With dead ends: 132 [2018-12-03 16:00:07,039 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:00:07,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 129 SyntacticMatches, 82 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:00:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:00:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:00:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:00:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 16:00:07,047 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 86 [2018-12-03 16:00:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:07,047 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 16:00:07,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:00:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 16:00:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:00:07,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:07,048 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-12-03 16:00:07,048 INFO L423 AbstractCegarLoop]: === Iteration 123 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:07,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:07,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1752850541, now seen corresponding path program 120 times [2018-12-03 16:00:07,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:07,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:07,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:07,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:07,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:07,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:07,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:07,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:07,777 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:07,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:07,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:07,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:07,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:07,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:07,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:07,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:07,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:07,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:09,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:09,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 16:00:09,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:09,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:00:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:00:09,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:00:09,358 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-03 16:00:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:09,481 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-12-03 16:00:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:00:09,482 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 16:00:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:09,483 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:00:09,483 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:00:09,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 129 SyntacticMatches, 82 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:00:09,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:00:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:00:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:00:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 16:00:09,491 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 16:00:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:09,491 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 16:00:09,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:00:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 16:00:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:00:09,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:09,492 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1] [2018-12-03 16:00:09,492 INFO L423 AbstractCegarLoop]: === Iteration 124 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:09,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:09,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1496269599, now seen corresponding path program 121 times [2018-12-03 16:00:09,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:09,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:09,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:10,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:10,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:10,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:10,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:10,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:10,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:10,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:10,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:10,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:10,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:10,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:10,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 16:00:10,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:10,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:00:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:00:10,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:00:10,741 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 44 states. [2018-12-03 16:00:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:12,965 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-12-03 16:00:12,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:00:12,965 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 87 [2018-12-03 16:00:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:12,966 INFO L225 Difference]: With dead ends: 134 [2018-12-03 16:00:12,966 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:00:12,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:00:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:00:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2018-12-03 16:00:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:00:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 16:00:12,971 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2018-12-03 16:00:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:12,972 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 16:00:12,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:00:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 16:00:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:00:12,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:12,972 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-12-03 16:00:12,972 INFO L423 AbstractCegarLoop]: === Iteration 125 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:12,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:12,973 INFO L82 PathProgramCache]: Analyzing trace with hash 860221165, now seen corresponding path program 122 times [2018-12-03 16:00:12,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:12,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:12,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:12,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:12,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:14,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:14,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:14,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:14,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:14,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:14,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:14,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:14,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:14,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:00:14,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:14,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:14,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:15,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:15,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:15,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 16:00:15,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:15,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:00:15,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:00:15,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:00:15,469 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 45 states. [2018-12-03 16:00:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:15,857 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-12-03 16:00:15,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:00:15,857 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 16:00:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:15,858 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:00:15,858 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:00:15,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 132 SyntacticMatches, 84 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:00:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:00:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:00:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:00:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-03 16:00:15,876 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 88 [2018-12-03 16:00:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:15,876 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-03 16:00:15,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:00:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-03 16:00:15,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:00:15,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:15,877 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-12-03 16:00:15,877 INFO L423 AbstractCegarLoop]: === Iteration 126 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:15,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:15,877 INFO L82 PathProgramCache]: Analyzing trace with hash -409358329, now seen corresponding path program 123 times [2018-12-03 16:00:15,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:15,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:15,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:15,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:15,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:16,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:16,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:16,646 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:16,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:16,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:16,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:16,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:16,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:16,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:16,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:16,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:16,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:16,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:18,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:18,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 16:00:18,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:18,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:00:18,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:00:18,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:00:18,040 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-03 16:00:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:18,168 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-03 16:00:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:00:18,168 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 16:00:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:18,169 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:00:18,169 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:00:18,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 132 SyntacticMatches, 84 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:00:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:00:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:00:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:00:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-03 16:00:18,175 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2018-12-03 16:00:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:18,175 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-03 16:00:18,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:00:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-03 16:00:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:00:18,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:18,176 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1] [2018-12-03 16:00:18,176 INFO L423 AbstractCegarLoop]: === Iteration 127 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:18,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:18,176 INFO L82 PathProgramCache]: Analyzing trace with hash 194732167, now seen corresponding path program 124 times [2018-12-03 16:00:18,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:18,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:18,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:18,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:19,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:19,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:19,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:19,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:19,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:19,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:19,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:19,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 16:00:19,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:19,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:00:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:00:19,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:00:19,483 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 45 states. [2018-12-03 16:00:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:21,805 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 16:00:21,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:00:21,805 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2018-12-03 16:00:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:21,806 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:00:21,806 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 16:00:21,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:00:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 16:00:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2018-12-03 16:00:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:00:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-12-03 16:00:21,812 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2018-12-03 16:00:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:21,813 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-12-03 16:00:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:00:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-12-03 16:00:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:00:21,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:21,813 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-12-03 16:00:21,814 INFO L423 AbstractCegarLoop]: === Iteration 128 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:21,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:21,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1741668359, now seen corresponding path program 125 times [2018-12-03 16:00:21,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:21,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:21,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:21,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:22,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:22,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:22,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:22,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:22,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:22,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:22,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:22,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:22,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:00:22,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:22,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:22,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:24,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:24,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 16:00:24,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:24,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:00:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:00:24,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:00:24,265 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 46 states. [2018-12-03 16:00:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:24,852 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-12-03 16:00:24,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:00:24,853 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 16:00:24,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:24,854 INFO L225 Difference]: With dead ends: 138 [2018-12-03 16:00:24,855 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:00:24,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 135 SyntacticMatches, 86 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:00:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:00:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:00:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:00:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 16:00:24,862 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 90 [2018-12-03 16:00:24,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:24,862 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 16:00:24,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:00:24,862 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 16:00:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:00:24,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:24,862 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-12-03 16:00:24,863 INFO L423 AbstractCegarLoop]: === Iteration 129 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:24,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:24,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1039409709, now seen corresponding path program 126 times [2018-12-03 16:00:24,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:24,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:24,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:24,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:24,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:25,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:25,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:25,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:25,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:25,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:25,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:25,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:25,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:25,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:25,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:25,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:25,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:27,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:27,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 16:00:27,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:27,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:00:27,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:00:27,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:00:27,115 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-03 16:00:27,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:27,246 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-12-03 16:00:27,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:00:27,247 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 16:00:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:27,247 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:00:27,247 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:00:27,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 135 SyntacticMatches, 86 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:00:27,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:00:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:00:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:00:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-12-03 16:00:27,254 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2018-12-03 16:00:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:27,254 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-12-03 16:00:27,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:00:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-12-03 16:00:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:00:27,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:27,255 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1] [2018-12-03 16:00:27,255 INFO L423 AbstractCegarLoop]: === Iteration 130 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:27,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2138098911, now seen corresponding path program 127 times [2018-12-03 16:00:27,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:27,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:27,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:27,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:27,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:28,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:28,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:28,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:28,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:28,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:28,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:28,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:28,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:28,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:28,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:28,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:28,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 16:00:28,417 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:28,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:00:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:00:28,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:00:28,418 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 46 states. [2018-12-03 16:00:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:30,990 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-12-03 16:00:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:00:30,990 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-12-03 16:00:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:30,991 INFO L225 Difference]: With dead ends: 140 [2018-12-03 16:00:30,991 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 16:00:30,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:00:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 16:00:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2018-12-03 16:00:30,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:00:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-12-03 16:00:30,997 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2018-12-03 16:00:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:30,997 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-12-03 16:00:30,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:00:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-12-03 16:00:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:00:30,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:30,998 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-12-03 16:00:30,998 INFO L423 AbstractCegarLoop]: === Iteration 131 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:30,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:30,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1856618323, now seen corresponding path program 128 times [2018-12-03 16:00:30,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:30,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:30,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:30,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:30,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:31,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:31,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:31,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:31,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:31,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:31,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:31,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:31,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:31,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:00:31,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:31,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:31,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:33,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:33,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 16:00:33,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:33,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:00:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:00:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:00:33,209 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 47 states. [2018-12-03 16:00:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:33,647 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-12-03 16:00:33,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:00:33,649 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-03 16:00:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:33,650 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:00:33,650 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:00:33,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 138 SyntacticMatches, 88 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:00:33,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:00:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:00:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:00:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 16:00:33,655 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 92 [2018-12-03 16:00:33,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:33,655 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 16:00:33,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:00:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 16:00:33,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:00:33,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:33,656 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-12-03 16:00:33,656 INFO L423 AbstractCegarLoop]: === Iteration 132 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:33,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:33,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2143167303, now seen corresponding path program 129 times [2018-12-03 16:00:33,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:33,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:33,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:33,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:34,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:34,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:34,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:34,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:34,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:34,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:34,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:34,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:34,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:34,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:34,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:34,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:36,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:36,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:36,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 16:00:36,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:36,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:00:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:00:36,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:00:36,315 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-03 16:00:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:36,450 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-12-03 16:00:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:00:36,450 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-03 16:00:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:36,451 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:00:36,451 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:00:36,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 138 SyntacticMatches, 88 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:00:36,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:00:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:00:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:00:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-03 16:00:36,459 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-12-03 16:00:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:36,459 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-03 16:00:36,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:00:36,459 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-03 16:00:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:00:36,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:36,460 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1] [2018-12-03 16:00:36,460 INFO L423 AbstractCegarLoop]: === Iteration 133 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:36,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:36,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2013615431, now seen corresponding path program 130 times [2018-12-03 16:00:36,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:36,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:36,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:36,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:37,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:37,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:37,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:37,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:37,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:37,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:37,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:37,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:37,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:37,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:37,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:37,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 16:00:37,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:37,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:00:37,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:00:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:00:37,766 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 47 states. [2018-12-03 16:00:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:40,476 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-12-03 16:00:40,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:00:40,477 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 93 [2018-12-03 16:00:40,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:40,478 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:00:40,478 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:00:40,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:00:40,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:00:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-12-03 16:00:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:00:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-12-03 16:00:40,484 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2018-12-03 16:00:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:40,484 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-12-03 16:00:40,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:00:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-12-03 16:00:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:00:40,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:40,484 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-12-03 16:00:40,485 INFO L423 AbstractCegarLoop]: === Iteration 134 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:40,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2002492601, now seen corresponding path program 131 times [2018-12-03 16:00:40,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:40,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:40,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:41,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:41,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:41,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:41,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:41,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:41,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:41,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:41,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:41,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:00:41,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:41,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:41,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:42,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:42,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 16:00:42,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:42,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:00:42,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:00:42,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:00:42,872 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 48 states. [2018-12-03 16:00:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:43,515 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-12-03 16:00:43,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:00:43,516 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 16:00:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:43,516 INFO L225 Difference]: With dead ends: 144 [2018-12-03 16:00:43,516 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:00:43,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 141 SyntacticMatches, 90 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:00:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:00:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:00:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:00:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-03 16:00:43,523 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 94 [2018-12-03 16:00:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:43,523 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-03 16:00:43,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:00:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-03 16:00:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:00:43,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:43,524 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-12-03 16:00:43,524 INFO L423 AbstractCegarLoop]: === Iteration 135 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:43,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:43,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1731777517, now seen corresponding path program 132 times [2018-12-03 16:00:43,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:43,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:43,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:43,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:43,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:44,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:44,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:44,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:44,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:44,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:44,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:44,625 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:44,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:44,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:44,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:44,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:46,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:46,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 16:00:46,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:46,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:00:46,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:00:46,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:00:46,231 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-03 16:00:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:46,370 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 16:00:46,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:00:46,370 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 16:00:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:46,371 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:00:46,371 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:00:46,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 141 SyntacticMatches, 90 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:00:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:00:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:00:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:00:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 16:00:46,378 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2018-12-03 16:00:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:46,378 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 16:00:46,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:00:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 16:00:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:00:46,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:46,378 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1] [2018-12-03 16:00:46,378 INFO L423 AbstractCegarLoop]: === Iteration 136 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:46,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2145433953, now seen corresponding path program 133 times [2018-12-03 16:00:46,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:46,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:46,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:47,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:47,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:47,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:47,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:47,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:47,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:47,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:47,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:47,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:47,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:47,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:47,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 16:00:47,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:47,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:00:47,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:00:47,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:00:47,616 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 48 states. [2018-12-03 16:00:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:50,448 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-12-03 16:00:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:00:50,449 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 95 [2018-12-03 16:00:50,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:50,449 INFO L225 Difference]: With dead ends: 146 [2018-12-03 16:00:50,449 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:00:50,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:00:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:00:50,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-12-03 16:00:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:00:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-03 16:00:50,456 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2018-12-03 16:00:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:50,456 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-03 16:00:50,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:00:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-03 16:00:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:00:50,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:50,457 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-12-03 16:00:50,457 INFO L423 AbstractCegarLoop]: === Iteration 137 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:50,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2083881581, now seen corresponding path program 134 times [2018-12-03 16:00:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:50,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:50,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:51,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:51,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:51,398 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:51,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:51,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:51,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:51,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:51,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:51,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:00:51,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:51,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:51,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:51,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:53,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:53,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 16:00:53,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:53,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:00:53,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:00:53,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:00:53,011 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 49 states. [2018-12-03 16:00:53,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:53,292 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-12-03 16:00:53,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:00:53,292 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 16:00:53,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:53,293 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:00:53,293 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:00:53,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 144 SyntacticMatches, 92 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:00:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:00:53,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:00:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:00:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 16:00:53,300 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 96 [2018-12-03 16:00:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:53,300 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 16:00:53,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:00:53,301 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 16:00:53,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:00:53,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:53,301 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-12-03 16:00:53,301 INFO L423 AbstractCegarLoop]: === Iteration 138 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:53,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1882138247, now seen corresponding path program 135 times [2018-12-03 16:00:53,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:53,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:53,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:53,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:53,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:54,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:54,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:54,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:54,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:54,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:54,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:54,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:54,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:54,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:54,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:54,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:54,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:56,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:56,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 16:00:56,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:56,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:00:56,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:00:56,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:00:56,118 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-03 16:00:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:56,294 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-12-03 16:00:56,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:00:56,295 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 16:00:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:56,295 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:00:56,296 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:00:56,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 144 SyntacticMatches, 92 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:00:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:00:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:00:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:00:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-12-03 16:00:56,302 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2018-12-03 16:00:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:56,302 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-12-03 16:00:56,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:00:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-12-03 16:00:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:00:56,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:56,303 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1] [2018-12-03 16:00:56,303 INFO L423 AbstractCegarLoop]: === Iteration 139 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:56,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1783318009, now seen corresponding path program 136 times [2018-12-03 16:00:56,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:56,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:56,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:56,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:56,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:57,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:57,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:57,464 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:57,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:57,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:57,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:57,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:57,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:57,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:57,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:57,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:57,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 16:00:57,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:57,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:00:57,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:00:57,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:00:57,620 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 49 states. [2018-12-03 16:01:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:00,555 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-12-03 16:01:00,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:01:00,555 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 97 [2018-12-03 16:01:00,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:00,556 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:01:00,556 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 16:01:00,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 235 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:01:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 16:01:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2018-12-03 16:01:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:01:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-03 16:01:00,562 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2018-12-03 16:01:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:00,563 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-03 16:01:00,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:01:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-03 16:01:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:01:00,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:00,563 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-12-03 16:01:00,563 INFO L423 AbstractCegarLoop]: === Iteration 140 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:00,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:00,563 INFO L82 PathProgramCache]: Analyzing trace with hash 551655047, now seen corresponding path program 137 times [2018-12-03 16:01:00,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:00,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:01,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:01,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:01,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:01,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:01,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:01,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:01,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:01,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:01:01,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:01,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:01,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:03,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:03,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 16:01:03,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:03,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:01:03,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:01:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:01:03,165 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 50 states. [2018-12-03 16:01:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:03,597 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-12-03 16:01:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:01:03,598 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 16:01:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:03,599 INFO L225 Difference]: With dead ends: 150 [2018-12-03 16:01:03,599 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:01:03,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 147 SyntacticMatches, 94 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2530 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:01:03,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:01:03,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:01:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:01:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 16:01:03,605 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 98 [2018-12-03 16:01:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:03,606 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 16:01:03,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:01:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 16:01:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:01:03,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:03,606 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-12-03 16:01:03,606 INFO L423 AbstractCegarLoop]: === Iteration 141 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:03,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:03,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1407421011, now seen corresponding path program 138 times [2018-12-03 16:01:03,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:03,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:03,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:04,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:04,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:04,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:04,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:04,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:04,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:04,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:04,518 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:04,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:04,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:04,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:04,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:04,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:06,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:06,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 16:01:06,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:06,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:01:06,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:01:06,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:01:06,492 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-03 16:01:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:06,716 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-12-03 16:01:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:01:06,717 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 16:01:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:06,718 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:01:06,718 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:01:06,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 147 SyntacticMatches, 94 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:01:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:01:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:01:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:01:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 16:01:06,725 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 16:01:06,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:06,725 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 16:01:06,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:01:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 16:01:06,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:01:06,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:06,725 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1] [2018-12-03 16:01:06,726 INFO L423 AbstractCegarLoop]: === Iteration 142 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:06,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:06,726 INFO L82 PathProgramCache]: Analyzing trace with hash -680439903, now seen corresponding path program 139 times [2018-12-03 16:01:06,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:06,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:06,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:06,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:07,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:07,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:07,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:07,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:07,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:07,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:07,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:08,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:08,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:08,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:08,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 16:01:08,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:08,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:01:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:01:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:01:08,122 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 50 states. [2018-12-03 16:01:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:11,185 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-12-03 16:01:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:01:11,185 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2018-12-03 16:01:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:11,186 INFO L225 Difference]: With dead ends: 152 [2018-12-03 16:01:11,186 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 16:01:11,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 240 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:01:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 16:01:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2018-12-03 16:01:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:01:11,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-12-03 16:01:11,192 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2018-12-03 16:01:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:11,193 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-12-03 16:01:11,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:01:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-12-03 16:01:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:01:11,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:11,193 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-12-03 16:01:11,193 INFO L423 AbstractCegarLoop]: === Iteration 143 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:11,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash 381137965, now seen corresponding path program 140 times [2018-12-03 16:01:11,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:11,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:11,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:11,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:11,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:12,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:12,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:12,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:12,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:12,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:12,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:12,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:12,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:12,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:01:12,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:12,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:12,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:13,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:13,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 16:01:13,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:13,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:01:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:01:13,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:01:13,836 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 51 states. [2018-12-03 16:01:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:14,205 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-12-03 16:01:14,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:01:14,206 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 16:01:14,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:14,206 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:01:14,207 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:01:14,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 150 SyntacticMatches, 96 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:01:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:01:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:01:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:01:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-03 16:01:14,215 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 100 [2018-12-03 16:01:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:14,215 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-03 16:01:14,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:01:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-03 16:01:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:01:14,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:14,216 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-12-03 16:01:14,216 INFO L423 AbstractCegarLoop]: === Iteration 144 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:14,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:14,216 INFO L82 PathProgramCache]: Analyzing trace with hash -220677689, now seen corresponding path program 141 times [2018-12-03 16:01:14,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:14,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:14,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:14,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:15,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:15,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:15,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:15,445 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:15,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:15,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:15,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:15,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:15,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:15,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:15,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:15,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:15,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:15,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:17,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:17,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 16:01:17,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:17,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:01:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:01:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:01:17,247 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-03 16:01:17,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:17,409 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-12-03 16:01:17,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:01:17,409 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 16:01:17,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:17,410 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:01:17,410 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:01:17,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 150 SyntacticMatches, 96 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:01:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:01:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:01:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:01:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-03 16:01:17,417 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 100 [2018-12-03 16:01:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:17,417 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-03 16:01:17,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:01:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-03 16:01:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:01:17,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:17,417 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1] [2018-12-03 16:01:17,418 INFO L423 AbstractCegarLoop]: === Iteration 145 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:17,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1748864711, now seen corresponding path program 142 times [2018-12-03 16:01:17,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:17,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:17,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:18,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:18,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:18,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:18,805 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:18,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:18,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:18,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:18,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:18,814 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:18,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:18,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:18,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:18,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 16:01:18,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:18,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:01:18,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:01:18,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:01:18,953 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 51 states. [2018-12-03 16:01:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:22,155 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-12-03 16:01:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:01:22,156 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 101 [2018-12-03 16:01:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:22,157 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:01:22,157 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 16:01:22,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 245 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:01:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 16:01:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 104. [2018-12-03 16:01:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:01:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 16:01:22,164 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2018-12-03 16:01:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:22,164 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 16:01:22,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:01:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 16:01:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:01:22,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:22,165 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-12-03 16:01:22,165 INFO L423 AbstractCegarLoop]: === Iteration 146 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:22,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1619830329, now seen corresponding path program 143 times [2018-12-03 16:01:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:22,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:22,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:22,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:22,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:23,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:23,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:23,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:23,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:23,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:23,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:23,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:23,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:23,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:01:23,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:23,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:23,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:24,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:24,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:01:24,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:24,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:01:24,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:01:24,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:01:24,988 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 52 states. [2018-12-03 16:01:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:25,414 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-12-03 16:01:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:01:25,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 16:01:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:25,415 INFO L225 Difference]: With dead ends: 156 [2018-12-03 16:01:25,415 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:01:25,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 153 SyntacticMatches, 98 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2736 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:01:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:01:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:01:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:01:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 16:01:25,423 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 102 [2018-12-03 16:01:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:25,423 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 16:01:25,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:01:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 16:01:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:01:25,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:25,423 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-12-03 16:01:25,423 INFO L423 AbstractCegarLoop]: === Iteration 147 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:25,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:25,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1198720877, now seen corresponding path program 144 times [2018-12-03 16:01:25,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:25,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:25,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:25,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:25,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:26,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:26,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:26,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:26,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:26,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:26,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:26,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:26,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:26,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:26,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:26,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:26,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:28,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:28,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:01:28,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:28,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:01:28,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:01:28,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:01:28,274 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-03 16:01:28,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:28,480 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-12-03 16:01:28,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:01:28,481 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 16:01:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:28,481 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:01:28,481 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:01:28,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 153 SyntacticMatches, 98 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:01:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:01:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:01:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:01:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-12-03 16:01:28,489 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2018-12-03 16:01:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:28,489 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-12-03 16:01:28,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:01:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-12-03 16:01:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:01:28,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:28,489 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1] [2018-12-03 16:01:28,489 INFO L423 AbstractCegarLoop]: === Iteration 148 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:28,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:28,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1494419999, now seen corresponding path program 145 times [2018-12-03 16:01:28,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:28,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:28,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:28,490 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:30,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:30,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:30,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:30,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:30,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:30,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:30,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:30,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:30,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:30,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:30,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:30,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:30,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 16:01:30,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:30,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:01:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:01:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:01:30,307 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 52 states. [2018-12-03 16:01:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:33,564 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-12-03 16:01:33,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:01:33,564 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 103 [2018-12-03 16:01:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:33,565 INFO L225 Difference]: With dead ends: 158 [2018-12-03 16:01:33,565 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:01:33,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:01:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:01:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2018-12-03 16:01:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:01:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-03 16:01:33,573 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2018-12-03 16:01:33,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:33,573 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-03 16:01:33,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:01:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-03 16:01:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:01:33,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:33,574 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-12-03 16:01:33,574 INFO L423 AbstractCegarLoop]: === Iteration 149 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:33,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash 917558765, now seen corresponding path program 146 times [2018-12-03 16:01:33,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:33,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:33,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:33,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:33,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:34,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:34,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:34,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:34,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:34,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:34,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:34,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:34,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:34,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:01:34,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:34,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:34,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:36,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:36,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 16:01:36,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:36,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:01:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:01:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:01:36,655 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 53 states. [2018-12-03 16:01:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:37,104 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2018-12-03 16:01:37,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:01:37,105 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-03 16:01:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:37,105 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:01:37,105 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:01:37,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 156 SyntacticMatches, 100 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2842 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:01:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:01:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:01:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:01:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 16:01:37,112 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2018-12-03 16:01:37,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:37,112 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 16:01:37,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:01:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 16:01:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:01:37,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:37,113 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-12-03 16:01:37,113 INFO L423 AbstractCegarLoop]: === Iteration 150 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:37,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1901667065, now seen corresponding path program 147 times [2018-12-03 16:01:37,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:37,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:37,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:38,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:38,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:38,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:38,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:38,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:38,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:38,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:38,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:38,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:38,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:38,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:38,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:40,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:40,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 16:01:40,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:40,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:01:40,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:01:40,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:01:40,115 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-03 16:01:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:40,284 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-12-03 16:01:40,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:01:40,285 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-03 16:01:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:40,285 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:01:40,285 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:01:40,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 156 SyntacticMatches, 100 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:01:40,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:01:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:01:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:01:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-12-03 16:01:40,293 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-12-03 16:01:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:40,293 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-12-03 16:01:40,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:01:40,293 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-12-03 16:01:40,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:01:40,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:40,294 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1] [2018-12-03 16:01:40,294 INFO L423 AbstractCegarLoop]: === Iteration 151 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:40,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1177801607, now seen corresponding path program 148 times [2018-12-03 16:01:40,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:40,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:40,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:40,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:40,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:41,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:41,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:41,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:41,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:41,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:41,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:41,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:41,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:41,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:42,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:42,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:42,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:01:42,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:42,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:01:42,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:01:42,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:01:42,066 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 53 states. [2018-12-03 16:01:45,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:45,344 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-12-03 16:01:45,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:01:45,345 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 105 [2018-12-03 16:01:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:45,345 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:01:45,345 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 16:01:45,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 255 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:01:45,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 16:01:45,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2018-12-03 16:01:45,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:01:45,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-03 16:01:45,353 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2018-12-03 16:01:45,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:45,353 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-03 16:01:45,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:01:45,353 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-03 16:01:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:01:45,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:45,353 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-12-03 16:01:45,353 INFO L423 AbstractCegarLoop]: === Iteration 152 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:45,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:45,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2142917369, now seen corresponding path program 149 times [2018-12-03 16:01:45,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:45,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:45,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:45,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:46,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:46,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:46,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:46,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:46,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:46,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:46,608 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:46,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:46,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:01:46,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:46,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:46,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:48,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:48,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 16:01:48,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:48,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:01:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:01:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:01:48,597 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 54 states. [2018-12-03 16:01:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:49,109 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 16:01:49,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:01:49,109 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 16:01:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:49,110 INFO L225 Difference]: With dead ends: 162 [2018-12-03 16:01:49,110 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:01:49,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 159 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:01:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:01:49,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:01:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:01:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-03 16:01:49,122 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 106 [2018-12-03 16:01:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:49,122 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-03 16:01:49,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:01:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-03 16:01:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:01:49,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:49,123 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-12-03 16:01:49,123 INFO L423 AbstractCegarLoop]: === Iteration 153 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:49,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash 655395117, now seen corresponding path program 150 times [2018-12-03 16:01:49,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:49,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:49,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:49,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:50,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:50,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:50,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:50,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:50,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:50,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:50,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:50,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:50,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:50,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:50,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:50,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:52,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:52,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 16:01:52,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:52,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:01:52,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:01:52,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:01:52,437 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-03 16:01:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:52,661 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 16:01:52,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:01:52,662 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 16:01:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:52,663 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:01:52,663 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:01:52,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 159 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2601 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:01:52,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:01:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:01:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:01:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 16:01:52,670 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2018-12-03 16:01:52,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:52,670 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 16:01:52,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:01:52,670 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 16:01:52,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:01:52,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:52,671 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1] [2018-12-03 16:01:52,671 INFO L423 AbstractCegarLoop]: === Iteration 154 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:52,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:52,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1157649375, now seen corresponding path program 151 times [2018-12-03 16:01:52,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:52,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:52,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:52,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:52,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:54,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:54,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:54,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:54,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:54,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:54,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:54,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:54,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:54,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:54,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:54,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:54,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 16:01:54,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:54,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:01:54,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:01:54,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:01:54,211 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 54 states. [2018-12-03 16:01:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:57,802 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-12-03 16:01:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:01:57,803 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2018-12-03 16:01:57,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:57,803 INFO L225 Difference]: With dead ends: 164 [2018-12-03 16:01:57,803 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 16:01:57,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 260 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:01:57,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 16:01:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2018-12-03 16:01:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:01:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-12-03 16:01:57,811 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2018-12-03 16:01:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:57,811 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-12-03 16:01:57,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:01:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-12-03 16:01:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:01:57,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:57,811 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-12-03 16:01:57,811 INFO L423 AbstractCegarLoop]: === Iteration 155 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:57,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1527453779, now seen corresponding path program 152 times [2018-12-03 16:01:57,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:57,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:57,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:57,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:57,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:58,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:58,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:58,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:58,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:58,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:58,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:58,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:01:58,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:58,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:58,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:00,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:00,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 16:02:00,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:00,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:02:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:02:00,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:02:00,862 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 55 states. [2018-12-03 16:02:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:01,387 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2018-12-03 16:02:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:02:01,387 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 16:02:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:01,388 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:02:01,388 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:02:01,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 162 SyntacticMatches, 104 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:02:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:02:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:02:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:02:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 16:02:01,395 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 108 [2018-12-03 16:02:01,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:01,396 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 16:02:01,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:02:01,396 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 16:02:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:02:01,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:01,396 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-12-03 16:02:01,396 INFO L423 AbstractCegarLoop]: === Iteration 156 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:01,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:01,397 INFO L82 PathProgramCache]: Analyzing trace with hash -679112633, now seen corresponding path program 153 times [2018-12-03 16:02:01,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:01,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:01,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:01,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:02,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:02,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:02,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:02,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:02,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:02,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:02,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:02,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:02,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:02,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:02,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:02,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:04,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:04,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 16:02:04,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:04,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:02:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:02:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:02:04,608 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-03 16:02:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:04,786 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-12-03 16:02:04,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:02:04,787 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 16:02:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:04,787 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:02:04,788 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:02:04,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 162 SyntacticMatches, 104 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2704 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:02:04,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:02:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:02:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:02:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-12-03 16:02:04,795 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 108 [2018-12-03 16:02:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:04,795 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-12-03 16:02:04,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:02:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-12-03 16:02:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 16:02:04,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:04,796 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1] [2018-12-03 16:02:04,796 INFO L423 AbstractCegarLoop]: === Iteration 157 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:04,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash 422283335, now seen corresponding path program 154 times [2018-12-03 16:02:04,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:04,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:04,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:04,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:06,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:06,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:06,495 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:06,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:06,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:06,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:06,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:06,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:06,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:06,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:06,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:06,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 16:02:06,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:06,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:02:06,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:02:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:02:06,657 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 55 states. [2018-12-03 16:02:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:10,167 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-12-03 16:02:10,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:02:10,168 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 109 [2018-12-03 16:02:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:10,168 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:02:10,169 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 16:02:10,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 265 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:02:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 16:02:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2018-12-03 16:02:10,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:02:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-03 16:02:10,176 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2018-12-03 16:02:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:10,176 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-03 16:02:10,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:02:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-03 16:02:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:02:10,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:10,177 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-12-03 16:02:10,177 INFO L423 AbstractCegarLoop]: === Iteration 158 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:10,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:10,177 INFO L82 PathProgramCache]: Analyzing trace with hash 205819975, now seen corresponding path program 155 times [2018-12-03 16:02:10,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:10,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:10,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:10,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:11,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:11,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:11,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:11,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:11,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:11,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:11,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:11,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:11,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:02:11,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:11,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:11,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:13,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:13,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 16:02:13,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:13,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:02:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:02:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:02:13,491 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 56 states. [2018-12-03 16:02:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:13,811 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-12-03 16:02:13,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:02:13,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 16:02:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:13,812 INFO L225 Difference]: With dead ends: 168 [2018-12-03 16:02:13,812 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:02:13,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 165 SyntacticMatches, 106 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3172 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:02:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:02:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:02:13,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:02:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 16:02:13,819 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 110 [2018-12-03 16:02:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:13,819 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 16:02:13,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:02:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 16:02:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:02:13,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:13,820 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-12-03 16:02:13,820 INFO L423 AbstractCegarLoop]: === Iteration 159 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:13,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:13,820 INFO L82 PathProgramCache]: Analyzing trace with hash 734591725, now seen corresponding path program 156 times [2018-12-03 16:02:13,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:13,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:13,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:13,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:13,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:14,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:14,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:14,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:14,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:14,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:14,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:14,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:14,956 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:15,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:15,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:15,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:15,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:17,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:17,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 16:02:17,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:17,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:02:17,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:02:17,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:02:17,291 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-03 16:02:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:17,480 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-12-03 16:02:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:02:17,481 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 16:02:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:17,481 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:02:17,482 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:02:17,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 165 SyntacticMatches, 106 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:02:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:02:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:02:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:02:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 16:02:17,489 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 16:02:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:17,490 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 16:02:17,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:02:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 16:02:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:02:17,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:17,490 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1] [2018-12-03 16:02:17,490 INFO L423 AbstractCegarLoop]: === Iteration 160 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:17,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:17,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1297445473, now seen corresponding path program 157 times [2018-12-03 16:02:17,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:17,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:17,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:17,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:17,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:19,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:19,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:19,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:19,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:19,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:19,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:19,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:19,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:19,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:19,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:19,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:19,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 16:02:19,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:19,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:02:19,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:02:19,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:02:19,869 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 56 states. [2018-12-03 16:02:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:23,405 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2018-12-03 16:02:23,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:02:23,405 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2018-12-03 16:02:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:23,406 INFO L225 Difference]: With dead ends: 170 [2018-12-03 16:02:23,406 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:02:23,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:02:23,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:02:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2018-12-03 16:02:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:02:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-12-03 16:02:23,414 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2018-12-03 16:02:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:23,415 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-12-03 16:02:23,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:02:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-12-03 16:02:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:02:23,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:23,415 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-12-03 16:02:23,416 INFO L423 AbstractCegarLoop]: === Iteration 161 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:23,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1566042477, now seen corresponding path program 158 times [2018-12-03 16:02:23,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:23,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:23,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:24,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:24,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:24,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:24,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:24,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:24,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:24,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:24,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:24,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:02:24,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:24,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:24,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:26,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:26,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-03 16:02:26,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:26,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:02:26,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:02:26,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:02:26,701 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 57 states. [2018-12-03 16:02:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:27,268 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-12-03 16:02:27,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:02:27,268 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 16:02:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:27,269 INFO L225 Difference]: With dead ends: 171 [2018-12-03 16:02:27,269 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:02:27,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 168 SyntacticMatches, 108 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3286 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:02:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:02:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:02:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:02:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-03 16:02:27,277 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 112 [2018-12-03 16:02:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:27,277 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-03 16:02:27,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:02:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-03 16:02:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:02:27,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:27,278 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-12-03 16:02:27,278 INFO L423 AbstractCegarLoop]: === Iteration 162 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:27,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash 778097543, now seen corresponding path program 159 times [2018-12-03 16:02:27,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:27,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:27,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:27,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:28,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:28,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:28,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:28,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:28,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:28,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:28,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:28,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:28,533 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:28,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:28,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:28,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:30,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:30,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:30,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-03 16:02:30,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:30,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:02:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:02:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:02:30,616 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-03 16:02:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:30,798 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-12-03 16:02:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:02:30,798 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 16:02:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:30,799 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:02:30,799 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:02:30,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 168 SyntacticMatches, 108 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:02:30,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:02:30,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:02:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:02:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-12-03 16:02:30,809 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 112 [2018-12-03 16:02:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:30,809 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-12-03 16:02:30,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:02:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-12-03 16:02:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:02:30,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:30,810 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1] [2018-12-03 16:02:30,810 INFO L423 AbstractCegarLoop]: === Iteration 163 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:30,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1648841465, now seen corresponding path program 160 times [2018-12-03 16:02:30,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:30,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:30,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:30,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:30,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:32,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:32,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:32,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:32,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:32,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:32,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:32,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:32,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:32,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:32,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:32,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 16:02:32,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:32,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:02:32,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:02:32,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:02:32,597 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 57 states. [2018-12-03 16:02:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:36,195 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-12-03 16:02:36,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:02:36,196 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 113 [2018-12-03 16:02:36,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:36,197 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:02:36,197 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 16:02:36,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:02:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 16:02:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2018-12-03 16:02:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:02:36,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-12-03 16:02:36,207 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 113 [2018-12-03 16:02:36,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:36,207 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-12-03 16:02:36,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:02:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-12-03 16:02:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:02:36,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:36,208 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-12-03 16:02:36,208 INFO L423 AbstractCegarLoop]: === Iteration 164 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:36,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:36,208 INFO L82 PathProgramCache]: Analyzing trace with hash 425460615, now seen corresponding path program 161 times [2018-12-03 16:02:36,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:36,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:36,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:36,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:37,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:37,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:37,538 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:37,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:37,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:37,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:37,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:37,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:37,673 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:02:37,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:37,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:37,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:39,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:39,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 16:02:39,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:39,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:02:39,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:02:39,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:02:39,850 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 58 states. [2018-12-03 16:02:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:40,413 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2018-12-03 16:02:40,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:02:40,414 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 16:02:40,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:40,414 INFO L225 Difference]: With dead ends: 174 [2018-12-03 16:02:40,414 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:02:40,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 171 SyntacticMatches, 110 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:02:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:02:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:02:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:02:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 16:02:40,424 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 114 [2018-12-03 16:02:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:40,424 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 16:02:40,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:02:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 16:02:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:02:40,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:40,425 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-12-03 16:02:40,425 INFO L423 AbstractCegarLoop]: === Iteration 165 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:40,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:40,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1768971437, now seen corresponding path program 162 times [2018-12-03 16:02:40,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:40,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:40,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:41,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:41,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:41,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:41,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:41,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:41,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:41,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:41,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:41,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:41,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:41,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:41,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:43,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:43,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 16:02:43,991 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:43,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:02:43,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:02:43,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:02:43,992 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-03 16:02:44,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:44,170 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-12-03 16:02:44,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:02:44,171 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 16:02:44,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:44,171 INFO L225 Difference]: With dead ends: 119 [2018-12-03 16:02:44,171 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:02:44,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 171 SyntacticMatches, 110 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:02:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:02:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:02:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:02:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-12-03 16:02:44,179 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 114 [2018-12-03 16:02:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:44,179 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-12-03 16:02:44,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:02:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-12-03 16:02:44,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 16:02:44,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:44,193 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1] [2018-12-03 16:02:44,193 INFO L423 AbstractCegarLoop]: === Iteration 166 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:44,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:44,193 INFO L82 PathProgramCache]: Analyzing trace with hash -996521823, now seen corresponding path program 163 times [2018-12-03 16:02:44,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:44,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:44,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:45,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:45,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:45,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:45,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:45,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:45,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:45,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:45,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:45,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:45,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:45,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:45,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:45,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-03 16:02:45,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:45,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:02:45,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:02:45,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:02:45,935 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 58 states. [2018-12-03 16:02:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:49,672 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-12-03 16:02:49,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:02:49,673 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 115 [2018-12-03 16:02:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:49,673 INFO L225 Difference]: With dead ends: 176 [2018-12-03 16:02:49,674 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 16:02:49,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 280 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:02:49,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 16:02:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2018-12-03 16:02:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 16:02:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-12-03 16:02:49,682 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 115 [2018-12-03 16:02:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:49,682 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-12-03 16:02:49,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:02:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-12-03 16:02:49,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:02:49,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:49,682 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-12-03 16:02:49,682 INFO L423 AbstractCegarLoop]: === Iteration 167 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:49,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash -827466963, now seen corresponding path program 164 times [2018-12-03 16:02:49,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:49,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:49,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:49,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:49,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:50,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:50,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:50,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:50,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:50,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:50,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:50,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:50,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:02:50,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:50,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:50,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:53,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:53,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 58 [2018-12-03 16:02:53,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:53,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:02:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:02:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:02:53,198 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 59 states. [2018-12-03 16:02:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:53,748 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-12-03 16:02:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:02:53,748 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-03 16:02:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:53,749 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:02:53,749 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:02:53,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 174 SyntacticMatches, 112 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3520 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:02:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:02:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 16:02:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 16:02:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 16:02:53,760 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 116 [2018-12-03 16:02:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:53,760 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 16:02:53,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:02:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 16:02:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:02:53,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:53,761 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-12-03 16:02:53,761 INFO L423 AbstractCegarLoop]: === Iteration 168 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:53,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:53,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2128304441, now seen corresponding path program 165 times [2018-12-03 16:02:53,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:53,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:53,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:53,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:55,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:55,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:55,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:55,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:55,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:55,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:55,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:55,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:55,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:55,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:55,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:55,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:57,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:57,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 58 [2018-12-03 16:02:57,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:57,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:02:57,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:02:57,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:02:57,376 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-03 16:02:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:57,613 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-12-03 16:02:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:02:57,613 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-03 16:02:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:57,614 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:02:57,614 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 16:02:57,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 174 SyntacticMatches, 112 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3136 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:02:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 16:02:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 16:02:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 16:02:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-03 16:02:57,622 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-12-03 16:02:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:57,622 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-03 16:02:57,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:02:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-03 16:02:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 16:02:57,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:57,622 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1] [2018-12-03 16:02:57,622 INFO L423 AbstractCegarLoop]: === Iteration 169 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:57,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1552989753, now seen corresponding path program 166 times [2018-12-03 16:02:57,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:57,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:57,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:02:57,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:57,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:59,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:59,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:59,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:59,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:59,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:59,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:59,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:59,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:02:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:59,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:59,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:59,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:59,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 16:02:59,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:59,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:02:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:02:59,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:02:59,402 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 59 states. [2018-12-03 16:03:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:03,306 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-12-03 16:03:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:03:03,307 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 117 [2018-12-03 16:03:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:03,307 INFO L225 Difference]: With dead ends: 179 [2018-12-03 16:03:03,308 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 16:03:03,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:03:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 16:03:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 120. [2018-12-03 16:03:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:03:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-03 16:03:03,316 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 117 [2018-12-03 16:03:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:03,316 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-03 16:03:03,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:03:03,316 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-03 16:03:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:03:03,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:03,316 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-12-03 16:03:03,317 INFO L423 AbstractCegarLoop]: === Iteration 170 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:03,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:03,317 INFO L82 PathProgramCache]: Analyzing trace with hash -898103609, now seen corresponding path program 167 times [2018-12-03 16:03:03,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:03,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:03,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:03,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:04,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:04,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:04,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:04,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:04,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:04,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:04,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:04,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:04,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:03:04,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:04,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:04,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:06,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:06,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 16:03:06,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:06,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:03:06,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:03:06,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:03:06,908 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 60 states. [2018-12-03 16:03:07,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:07,475 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2018-12-03 16:03:07,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:03:07,475 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 16:03:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:07,476 INFO L225 Difference]: With dead ends: 180 [2018-12-03 16:03:07,476 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 16:03:07,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 177 SyntacticMatches, 114 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3640 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:03:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 16:03:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 16:03:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 16:03:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-03 16:03:07,484 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 118 [2018-12-03 16:03:07,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:07,484 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-03 16:03:07,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:03:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-03 16:03:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:03:07,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:07,485 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-12-03 16:03:07,485 INFO L423 AbstractCegarLoop]: === Iteration 171 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:07,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1725607533, now seen corresponding path program 168 times [2018-12-03 16:03:07,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:07,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:07,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:07,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:08,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:08,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:08,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:08,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:08,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:08,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:08,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:08,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:08,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:08,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:08,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:09,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:11,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:11,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 16:03:11,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:11,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:03:11,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:03:11,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:03:11,339 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-03 16:03:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:11,524 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-12-03 16:03:11,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:03:11,525 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 16:03:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:11,525 INFO L225 Difference]: With dead ends: 123 [2018-12-03 16:03:11,525 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 16:03:11,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 177 SyntacticMatches, 114 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:03:11,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 16:03:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 16:03:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:03:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-03 16:03:11,533 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 118 [2018-12-03 16:03:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:11,534 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-03 16:03:11,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:03:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-03 16:03:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 16:03:11,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:11,534 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1] [2018-12-03 16:03:11,534 INFO L423 AbstractCegarLoop]: === Iteration 172 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:11,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:11,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1954164449, now seen corresponding path program 169 times [2018-12-03 16:03:11,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:11,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:11,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:13,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:13,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:13,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:13,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:13,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:13,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:13,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:13,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:13,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:13,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:13,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:13,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 58 [2018-12-03 16:03:13,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:13,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:03:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:03:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:03:13,400 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 60 states. [2018-12-03 16:03:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:17,367 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-12-03 16:03:17,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:03:17,368 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 119 [2018-12-03 16:03:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:17,368 INFO L225 Difference]: With dead ends: 182 [2018-12-03 16:03:17,368 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 16:03:17,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:03:17,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 16:03:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-12-03 16:03:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 16:03:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-03 16:03:17,377 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 119 [2018-12-03 16:03:17,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:17,377 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-03 16:03:17,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:03:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-03 16:03:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 16:03:17,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:17,377 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-12-03 16:03:17,377 INFO L423 AbstractCegarLoop]: === Iteration 173 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:17,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash 449494253, now seen corresponding path program 170 times [2018-12-03 16:03:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:17,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:17,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:17,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:18,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:18,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:18,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:18,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:18,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:18,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:18,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:18,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:18,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:03:18,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:18,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:18,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:21,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 60 [2018-12-03 16:03:21,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:21,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:03:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:03:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:03:21,244 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 61 states. [2018-12-03 16:03:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:21,897 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2018-12-03 16:03:21,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:03:21,898 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 16:03:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:21,898 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:03:21,898 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:03:21,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 180 SyntacticMatches, 116 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:03:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:03:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 16:03:21,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 16:03:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 16:03:21,908 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 120 [2018-12-03 16:03:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:21,908 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 16:03:21,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:03:21,908 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 16:03:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 16:03:21,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:21,909 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-12-03 16:03:21,909 INFO L423 AbstractCegarLoop]: === Iteration 174 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:21,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:21,909 INFO L82 PathProgramCache]: Analyzing trace with hash 180161031, now seen corresponding path program 171 times [2018-12-03 16:03:21,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:21,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:21,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:21,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:23,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:23,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:23,296 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:23,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:23,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:23,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:23,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:23,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:23,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:23,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:23,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:23,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:25,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:25,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 60 [2018-12-03 16:03:25,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:25,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:03:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:03:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:03:25,792 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-03 16:03:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:26,015 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-12-03 16:03:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:03:26,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 16:03:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:26,016 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:03:26,016 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 16:03:26,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 180 SyntacticMatches, 116 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3364 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:03:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 16:03:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 16:03:26,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 16:03:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-12-03 16:03:26,024 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 120 [2018-12-03 16:03:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:26,024 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-12-03 16:03:26,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:03:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-12-03 16:03:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 16:03:26,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:26,025 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1] [2018-12-03 16:03:26,025 INFO L423 AbstractCegarLoop]: === Iteration 175 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:26,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1289963143, now seen corresponding path program 172 times [2018-12-03 16:03:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:26,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:26,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:26,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:27,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:27,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:27,870 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:27,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:27,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:27,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:27,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:27,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:27,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:27,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:27,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:28,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:28,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 16:03:28,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:28,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:03:28,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:03:28,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:03:28,051 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 61 states. [2018-12-03 16:03:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:32,197 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-12-03 16:03:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:03:32,197 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 121 [2018-12-03 16:03:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:32,198 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:03:32,198 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 16:03:32,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 295 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:03:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 16:03:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 124. [2018-12-03 16:03:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:03:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-12-03 16:03:32,206 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 121 [2018-12-03 16:03:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:32,206 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-12-03 16:03:32,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:03:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-12-03 16:03:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:03:32,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:32,207 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-12-03 16:03:32,207 INFO L423 AbstractCegarLoop]: === Iteration 176 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:32,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1334090247, now seen corresponding path program 173 times [2018-12-03 16:03:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:32,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:32,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:33,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:33,547 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:33,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:33,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:33,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:33,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:33,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:33,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:03:33,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:33,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:33,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:33,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:36,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:36,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 16:03:36,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:36,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:03:36,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:03:36,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:03:36,071 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 62 states. [2018-12-03 16:03:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:36,689 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2018-12-03 16:03:36,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:03:36,689 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 16:03:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:36,690 INFO L225 Difference]: With dead ends: 186 [2018-12-03 16:03:36,690 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:03:36,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 183 SyntacticMatches, 118 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:03:36,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:03:36,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 16:03:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:03:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 16:03:36,699 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 122 [2018-12-03 16:03:36,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:36,699 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 16:03:36,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:03:36,699 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 16:03:36,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:03:36,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:36,700 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-12-03 16:03:36,700 INFO L423 AbstractCegarLoop]: === Iteration 177 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:36,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1574694957, now seen corresponding path program 174 times [2018-12-03 16:03:36,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:36,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:36,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:36,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:38,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:38,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:38,057 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:38,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:38,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:38,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:38,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:38,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:38,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:38,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:38,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:38,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:40,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:40,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 16:03:40,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:40,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:03:40,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:03:40,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:03:40,701 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-03 16:03:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:40,945 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-12-03 16:03:40,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:03:40,946 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 16:03:40,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:40,946 INFO L225 Difference]: With dead ends: 127 [2018-12-03 16:03:40,946 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:03:40,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 183 SyntacticMatches, 118 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:03:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:03:40,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 16:03:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:03:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-12-03 16:03:40,955 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-12-03 16:03:40,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:40,955 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-12-03 16:03:40,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:03:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-12-03 16:03:40,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:03:40,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:40,956 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1] [2018-12-03 16:03:40,956 INFO L423 AbstractCegarLoop]: === Iteration 178 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:40,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1570841889, now seen corresponding path program 175 times [2018-12-03 16:03:40,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:40,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:40,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:40,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:42,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:42,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:42,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:42,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:42,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:42,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:42,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:42,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:42,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:42,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 60 [2018-12-03 16:03:42,885 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:42,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:03:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:03:42,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:03:42,886 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 62 states. [2018-12-03 16:03:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:47,163 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-12-03 16:03:47,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:03:47,163 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 123 [2018-12-03 16:03:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:47,164 INFO L225 Difference]: With dead ends: 188 [2018-12-03 16:03:47,164 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 16:03:47,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 300 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:03:47,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 16:03:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 126. [2018-12-03 16:03:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:03:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-12-03 16:03:47,173 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 123 [2018-12-03 16:03:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:47,173 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-12-03 16:03:47,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:03:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-12-03 16:03:47,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 16:03:47,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:47,173 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-12-03 16:03:47,174 INFO L423 AbstractCegarLoop]: === Iteration 179 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:47,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1451396781, now seen corresponding path program 176 times [2018-12-03 16:03:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:47,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:47,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:48,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:48,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:48,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:48,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:48,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:48,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:48,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:48,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:48,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:03:48,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:48,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:48,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:51,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:51,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 62 [2018-12-03 16:03:51,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:51,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:03:51,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:03:51,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:03:51,241 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 63 states. [2018-12-03 16:03:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:51,869 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2018-12-03 16:03:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:03:51,870 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 16:03:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:51,870 INFO L225 Difference]: With dead ends: 189 [2018-12-03 16:03:51,870 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 16:03:51,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 186 SyntacticMatches, 120 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4012 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:03:51,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 16:03:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 16:03:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 16:03:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-03 16:03:51,879 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 124 [2018-12-03 16:03:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:51,879 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-03 16:03:51,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:03:51,879 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-03 16:03:51,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 16:03:51,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:51,880 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-12-03 16:03:51,880 INFO L423 AbstractCegarLoop]: === Iteration 180 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:51,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:51,880 INFO L82 PathProgramCache]: Analyzing trace with hash 320208199, now seen corresponding path program 177 times [2018-12-03 16:03:51,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:51,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:51,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:51,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:53,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:53,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:53,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:53,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:53,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:53,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:53,294 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:53,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:53,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:53,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:53,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:53,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:53,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:55,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:55,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 62 [2018-12-03 16:03:55,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:55,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:03:55,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:03:55,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:03:55,987 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-03 16:03:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:56,180 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-12-03 16:03:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:03:56,180 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 16:03:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:56,181 INFO L225 Difference]: With dead ends: 129 [2018-12-03 16:03:56,181 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 16:03:56,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 186 SyntacticMatches, 120 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3600 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:03:56,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 16:03:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 16:03:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:03:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-03 16:03:56,190 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 124 [2018-12-03 16:03:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:56,190 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-03 16:03:56,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:03:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-03 16:03:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 16:03:56,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:56,191 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1] [2018-12-03 16:03:56,191 INFO L423 AbstractCegarLoop]: === Iteration 181 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:56,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1336458055, now seen corresponding path program 178 times [2018-12-03 16:03:56,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:56,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:56,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:56,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:58,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:58,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:58,009 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:58,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:58,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:58,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:03:58,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:58,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:58,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:58,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:58,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:58,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 16:03:58,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:58,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:03:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:03:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:03:58,192 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 63 states. [2018-12-03 16:04:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:02,613 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2018-12-03 16:04:02,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:04:02,613 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 125 [2018-12-03 16:04:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:02,614 INFO L225 Difference]: With dead ends: 191 [2018-12-03 16:04:02,614 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 16:04:02,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 305 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:04:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 16:04:02,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-12-03 16:04:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 16:04:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-12-03 16:04:02,623 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 125 [2018-12-03 16:04:02,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:02,623 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-12-03 16:04:02,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:04:02,623 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-12-03 16:04:02,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:04:02,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:02,624 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-12-03 16:04:02,624 INFO L423 AbstractCegarLoop]: === Iteration 182 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:02,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:02,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1519534777, now seen corresponding path program 179 times [2018-12-03 16:04:02,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:02,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:02,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:02,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:02,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:04,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:04,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:04,126 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:04,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:04,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:04,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:04,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:04,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:04,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:04:04,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:04,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:04,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:06,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:06,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 16:04:06,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:06,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:04:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:04:06,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:04:06,849 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 64 states. [2018-12-03 16:04:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:07,455 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-12-03 16:04:07,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:04:07,455 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 16:04:07,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:07,456 INFO L225 Difference]: With dead ends: 192 [2018-12-03 16:04:07,456 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:04:07,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 189 SyntacticMatches, 122 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:04:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:04:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 16:04:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 16:04:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 16:04:07,465 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 126 [2018-12-03 16:04:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:07,465 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 16:04:07,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:04:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 16:04:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:04:07,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:07,465 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-12-03 16:04:07,466 INFO L423 AbstractCegarLoop]: === Iteration 183 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:07,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:07,466 INFO L82 PathProgramCache]: Analyzing trace with hash 2068324845, now seen corresponding path program 180 times [2018-12-03 16:04:07,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:07,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:07,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:07,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:07,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:08,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:08,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:08,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:08,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:08,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:08,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:08,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:08,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:08,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:08,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:08,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:09,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:11,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:11,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 16:04:11,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:11,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:04:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:04:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:04:11,720 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-03 16:04:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:11,954 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-12-03 16:04:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:04:11,955 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 16:04:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:11,955 INFO L225 Difference]: With dead ends: 131 [2018-12-03 16:04:11,955 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 16:04:11,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 189 SyntacticMatches, 122 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3721 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:04:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 16:04:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 16:04:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 16:04:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-12-03 16:04:11,964 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 126 [2018-12-03 16:04:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:11,964 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-12-03 16:04:11,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:04:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-12-03 16:04:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 16:04:11,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:11,965 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1] [2018-12-03 16:04:11,965 INFO L423 AbstractCegarLoop]: === Iteration 184 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:11,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -306500767, now seen corresponding path program 181 times [2018-12-03 16:04:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:11,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:11,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:11,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:13,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:13,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:13,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:13,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:13,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:13,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:13,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:13,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:13,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:13,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:13,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:14,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:14,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 62 [2018-12-03 16:04:14,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:14,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:04:14,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:04:14,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:04:14,032 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 64 states. [2018-12-03 16:04:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:18,607 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-12-03 16:04:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:04:18,608 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 127 [2018-12-03 16:04:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:18,608 INFO L225 Difference]: With dead ends: 194 [2018-12-03 16:04:18,609 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 16:04:18,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 310 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:04:18,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 16:04:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 130. [2018-12-03 16:04:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:04:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-12-03 16:04:18,618 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2018-12-03 16:04:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:18,618 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-12-03 16:04:18,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:04:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-12-03 16:04:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:04:18,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:18,618 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-12-03 16:04:18,619 INFO L423 AbstractCegarLoop]: === Iteration 185 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:18,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash -911650707, now seen corresponding path program 182 times [2018-12-03 16:04:18,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:18,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:18,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:18,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:18,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:20,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:20,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:20,069 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:20,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:20,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:20,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:20,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:20,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:20,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:04:20,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:20,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:20,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:22,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:22,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 64 [2018-12-03 16:04:22,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:22,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:04:22,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:04:22,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:04:22,853 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 65 states. [2018-12-03 16:04:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:23,526 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-12-03 16:04:23,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:04:23,527 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 16:04:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:23,527 INFO L225 Difference]: With dead ends: 195 [2018-12-03 16:04:23,527 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 16:04:23,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 192 SyntacticMatches, 124 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4270 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:04:23,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 16:04:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 16:04:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 16:04:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 16:04:23,536 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 128 [2018-12-03 16:04:23,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:23,536 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 16:04:23,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:04:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 16:04:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:04:23,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:23,537 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-12-03 16:04:23,537 INFO L423 AbstractCegarLoop]: === Iteration 186 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:23,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1357152121, now seen corresponding path program 183 times [2018-12-03 16:04:23,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:23,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:23,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:23,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:25,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:25,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:25,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:25,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:25,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:25,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:25,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:25,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:25,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:25,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:27,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:27,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:27,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 64 [2018-12-03 16:04:27,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:27,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:04:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:04:27,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:04:27,874 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-03 16:04:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:28,081 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-12-03 16:04:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:04:28,081 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 16:04:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:28,082 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:04:28,082 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 16:04:28,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 192 SyntacticMatches, 124 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:04:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 16:04:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 16:04:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:04:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-12-03 16:04:28,090 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-12-03 16:04:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:28,090 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-12-03 16:04:28,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:04:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-12-03 16:04:28,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 16:04:28,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:28,091 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1] [2018-12-03 16:04:28,091 INFO L423 AbstractCegarLoop]: === Iteration 187 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:28,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:28,091 INFO L82 PathProgramCache]: Analyzing trace with hash 877895687, now seen corresponding path program 184 times [2018-12-03 16:04:28,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:28,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:28,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:28,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:30,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:30,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:30,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:30,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:30,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:30,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:30,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:30,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:30,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:30,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:30,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:30,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 16:04:30,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:30,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:04:30,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:04:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:04:30,229 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 65 states. [2018-12-03 16:04:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:34,937 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 16:04:34,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:04:34,938 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 129 [2018-12-03 16:04:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:34,938 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:04:34,939 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 16:04:34,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:04:34,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 16:04:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 132. [2018-12-03 16:04:34,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:04:34,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-12-03 16:04:34,952 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 129 [2018-12-03 16:04:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:34,952 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-12-03 16:04:34,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:04:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-12-03 16:04:34,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 16:04:34,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:34,953 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-12-03 16:04:34,953 INFO L423 AbstractCegarLoop]: === Iteration 188 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:34,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1444900999, now seen corresponding path program 185 times [2018-12-03 16:04:34,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:34,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:34,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:34,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:34,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:36,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:36,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:36,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:36,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:36,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:36,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:36,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:36,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:36,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 16:04:36,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:36,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:36,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:36,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:39,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:39,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 16:04:39,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:39,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:04:39,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:04:39,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:04:39,477 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 66 states. [2018-12-03 16:04:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:40,034 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2018-12-03 16:04:40,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:04:40,034 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 16:04:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:40,035 INFO L225 Difference]: With dead ends: 198 [2018-12-03 16:04:40,035 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:04:40,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 195 SyntacticMatches, 126 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:04:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:04:40,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 16:04:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 16:04:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-03 16:04:40,045 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 130 [2018-12-03 16:04:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:40,045 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-03 16:04:40,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:04:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-03 16:04:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 16:04:40,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:40,045 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-12-03 16:04:40,046 INFO L423 AbstractCegarLoop]: === Iteration 189 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:40,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 519259053, now seen corresponding path program 186 times [2018-12-03 16:04:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:40,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:40,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:41,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:41,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:41,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:41,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:41,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:41,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:41,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:41,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:41,665 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:41,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:41,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:41,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:44,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:44,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 16:04:44,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:44,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:04:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:04:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:04:44,479 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-03 16:04:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:44,729 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-12-03 16:04:44,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:04:44,729 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 16:04:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:44,730 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:04:44,730 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 16:04:44,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 195 SyntacticMatches, 126 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3969 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:04:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 16:04:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 16:04:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:04:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-12-03 16:04:44,739 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 130 [2018-12-03 16:04:44,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:44,739 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-12-03 16:04:44,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:04:44,739 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-12-03 16:04:44,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 16:04:44,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:44,740 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1] [2018-12-03 16:04:44,740 INFO L423 AbstractCegarLoop]: === Iteration 190 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:44,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1082900063, now seen corresponding path program 187 times [2018-12-03 16:04:44,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:44,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:44,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:44,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:46,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:46,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:46,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:46,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:46,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:46,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:46,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:04:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:46,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:46,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:46,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:46,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 64 [2018-12-03 16:04:46,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:46,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:04:46,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:04:46,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:04:46,985 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 66 states. [2018-12-03 16:04:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:51,835 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2018-12-03 16:04:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:04:51,836 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 131 [2018-12-03 16:04:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:51,836 INFO L225 Difference]: With dead ends: 200 [2018-12-03 16:04:51,837 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 16:04:51,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:04:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 16:04:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 134. [2018-12-03 16:04:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 16:04:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-12-03 16:04:51,846 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 131 [2018-12-03 16:04:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:51,847 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-12-03 16:04:51,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:04:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-12-03 16:04:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:04:51,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:51,847 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-12-03 16:04:51,847 INFO L423 AbstractCegarLoop]: === Iteration 191 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:51,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:51,848 INFO L82 PathProgramCache]: Analyzing trace with hash 789774893, now seen corresponding path program 188 times [2018-12-03 16:04:51,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:51,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:51,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:04:51,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:51,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:53,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:53,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:53,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:53,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:53,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:53,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:53,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:53,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:04:53,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:04:53,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 16:04:53,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:53,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:53,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:53,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:04:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:56,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:04:56,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 66 [2018-12-03 16:04:56,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:04:56,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:04:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:04:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:04:56,388 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 67 states. [2018-12-03 16:04:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:04:56,943 INFO L93 Difference]: Finished difference Result 201 states and 203 transitions. [2018-12-03 16:04:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:04:56,944 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 16:04:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:04:56,944 INFO L225 Difference]: With dead ends: 201 [2018-12-03 16:04:56,944 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:04:56,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 198 SyntacticMatches, 128 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:04:56,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:04:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 16:04:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 16:04:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 16:04:56,956 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 132 [2018-12-03 16:04:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:04:56,956 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 16:04:56,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:04:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 16:04:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:04:56,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:04:56,957 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-12-03 16:04:56,957 INFO L423 AbstractCegarLoop]: === Iteration 192 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:04:56,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:04:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2135321657, now seen corresponding path program 189 times [2018-12-03 16:04:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:04:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:56,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:04:56,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:04:56,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:04:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:04:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:58,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:58,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:04:58,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:04:58,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:04:58,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:04:58,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:04:58,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:04:58,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:04:58,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:04:58,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:04:58,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:04:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:04:58,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:01,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:01,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 66 [2018-12-03 16:05:01,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:01,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:05:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:05:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:05:01,588 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-03 16:05:01,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:01,806 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-12-03 16:05:01,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:05:01,807 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 16:05:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:01,807 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:05:01,807 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 16:05:01,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 198 SyntacticMatches, 128 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:05:01,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 16:05:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 16:05:01,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 16:05:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-12-03 16:05:01,818 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 132 [2018-12-03 16:05:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:01,818 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-12-03 16:05:01,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:05:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-12-03 16:05:01,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 16:05:01,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:01,819 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1] [2018-12-03 16:05:01,819 INFO L423 AbstractCegarLoop]: === Iteration 193 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:01,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:01,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1770523449, now seen corresponding path program 190 times [2018-12-03 16:05:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:01,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:01,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:01,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:01,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:03,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:03,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:03,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:03,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:03,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:03,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:03,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:03,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:03,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:04,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:04,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:04,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:04,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 16:05:04,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:04,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:05:04,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:05:04,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:05:04,074 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 67 states. [2018-12-03 16:05:09,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:09,081 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2018-12-03 16:05:09,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:05:09,081 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 133 [2018-12-03 16:05:09,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:09,082 INFO L225 Difference]: With dead ends: 203 [2018-12-03 16:05:09,082 INFO L226 Difference]: Without dead ends: 200 [2018-12-03 16:05:09,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:05:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-03 16:05:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2018-12-03 16:05:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:05:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 16:05:09,092 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2018-12-03 16:05:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:09,092 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 16:05:09,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:05:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 16:05:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:05:09,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:09,092 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-12-03 16:05:09,092 INFO L423 AbstractCegarLoop]: === Iteration 194 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:09,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:09,093 INFO L82 PathProgramCache]: Analyzing trace with hash 948286407, now seen corresponding path program 191 times [2018-12-03 16:05:09,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:09,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:09,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:09,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:09,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:10,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:10,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:10,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:10,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:10,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:10,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:10,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:10,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:10,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:05:10,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:10,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:10,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:13,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:13,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 16:05:13,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:13,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:05:13,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:05:13,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:05:13,670 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 68 states. [2018-12-03 16:05:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:14,393 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2018-12-03 16:05:14,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:05:14,394 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 16:05:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:14,394 INFO L225 Difference]: With dead ends: 204 [2018-12-03 16:05:14,394 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:05:14,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 201 SyntacticMatches, 130 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:05:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:05:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 16:05:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 16:05:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 16:05:14,413 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 134 [2018-12-03 16:05:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:14,413 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 16:05:14,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:05:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 16:05:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:05:14,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:14,414 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-12-03 16:05:14,414 INFO L423 AbstractCegarLoop]: === Iteration 195 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:14,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 464606573, now seen corresponding path program 192 times [2018-12-03 16:05:14,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:14,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:14,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:16,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:16,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:16,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:16,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:16,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:16,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:16,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:16,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:16,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:16,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:16,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:16,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:19,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:19,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 16:05:19,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:19,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:05:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:05:19,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:05:19,210 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-03 16:05:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:19,497 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-12-03 16:05:19,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:05:19,497 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 16:05:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:19,498 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:05:19,498 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:05:19,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 201 SyntacticMatches, 130 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:05:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:05:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 16:05:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:05:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-03 16:05:19,508 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-12-03 16:05:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-03 16:05:19,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:05:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-03 16:05:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:05:19,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:19,509 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1] [2018-12-03 16:05:19,509 INFO L423 AbstractCegarLoop]: === Iteration 196 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:19,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1517840353, now seen corresponding path program 193 times [2018-12-03 16:05:19,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:19,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:19,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:21,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:21,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:21,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:21,617 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:21,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:21,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:21,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:21,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:21,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:21,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:21,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:21,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:21,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 66 [2018-12-03 16:05:21,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:21,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:05:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:05:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:05:21,804 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 68 states. [2018-12-03 16:05:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:26,939 INFO L93 Difference]: Finished difference Result 206 states and 208 transitions. [2018-12-03 16:05:26,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:05:26,940 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 135 [2018-12-03 16:05:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:26,940 INFO L225 Difference]: With dead ends: 206 [2018-12-03 16:05:26,941 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 16:05:26,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 330 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:05:26,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 16:05:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 138. [2018-12-03 16:05:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:05:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-12-03 16:05:26,950 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 135 [2018-12-03 16:05:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:26,950 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-12-03 16:05:26,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:05:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-12-03 16:05:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 16:05:26,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:26,951 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-12-03 16:05:26,951 INFO L423 AbstractCegarLoop]: === Iteration 197 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:26,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash -191650835, now seen corresponding path program 194 times [2018-12-03 16:05:26,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:26,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:26,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:28,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:28,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:28,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:28,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:28,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:28,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:28,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:28,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:05:28,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:28,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:28,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:31,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:31,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:31,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 68 [2018-12-03 16:05:31,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:31,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:05:31,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:05:31,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:05:31,683 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 69 states. [2018-12-03 16:05:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:32,446 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-12-03 16:05:32,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:05:32,447 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 16:05:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:32,447 INFO L225 Difference]: With dead ends: 207 [2018-12-03 16:05:32,448 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 16:05:32,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 204 SyntacticMatches, 132 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4810 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:05:32,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 16:05:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 16:05:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 16:05:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-03 16:05:32,458 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 136 [2018-12-03 16:05:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:32,458 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-03 16:05:32,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:05:32,458 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-03 16:05:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 16:05:32,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:32,458 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-12-03 16:05:32,459 INFO L423 AbstractCegarLoop]: === Iteration 198 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:32,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1994143495, now seen corresponding path program 195 times [2018-12-03 16:05:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:32,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:32,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:32,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:34,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:34,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:34,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:34,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:34,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:34,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:34,143 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:34,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:34,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:34,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:34,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:37,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:37,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 68 [2018-12-03 16:05:37,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:37,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:05:37,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:05:37,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:05:37,335 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-03 16:05:37,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:37,614 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-12-03 16:05:37,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:05:37,614 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 16:05:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:37,614 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:05:37,615 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 16:05:37,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 204 SyntacticMatches, 132 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:05:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 16:05:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 16:05:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:05:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-12-03 16:05:37,626 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 136 [2018-12-03 16:05:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:37,626 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-12-03 16:05:37,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:05:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-12-03 16:05:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:05:37,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:37,626 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1] [2018-12-03 16:05:37,626 INFO L423 AbstractCegarLoop]: === Iteration 199 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:37,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:37,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1688844679, now seen corresponding path program 196 times [2018-12-03 16:05:37,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:37,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:37,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:37,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:39,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:39,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:39,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:39,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:39,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:39,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:39,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:39,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:39,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:39,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:39,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 16:05:39,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:39,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:05:39,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:05:39,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:05:39,969 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 69 states. [2018-12-03 16:05:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:45,273 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-12-03 16:05:45,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:05:45,274 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 137 [2018-12-03 16:05:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:45,274 INFO L225 Difference]: With dead ends: 209 [2018-12-03 16:05:45,274 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 16:05:45,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:05:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 16:05:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 140. [2018-12-03 16:05:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:05:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-12-03 16:05:45,285 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 137 [2018-12-03 16:05:45,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:45,285 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-12-03 16:05:45,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:05:45,285 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-12-03 16:05:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:05:45,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:45,286 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-12-03 16:05:45,286 INFO L423 AbstractCegarLoop]: === Iteration 200 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:45,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:45,286 INFO L82 PathProgramCache]: Analyzing trace with hash 814515975, now seen corresponding path program 197 times [2018-12-03 16:05:45,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:45,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:45,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:45,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:45,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:46,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:46,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:46,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:46,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:46,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:46,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:46,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:47,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:05:47,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:47,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:47,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:50,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:50,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 16:05:50,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:50,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:05:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:05:50,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:05:50,130 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 70 states. [2018-12-03 16:05:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:50,933 INFO L93 Difference]: Finished difference Result 210 states and 212 transitions. [2018-12-03 16:05:50,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:05:50,933 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 16:05:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:50,934 INFO L225 Difference]: With dead ends: 210 [2018-12-03 16:05:50,934 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:05:50,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 207 SyntacticMatches, 134 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:05:50,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:05:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 16:05:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 16:05:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 16:05:50,944 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 138 [2018-12-03 16:05:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:50,944 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 16:05:50,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:05:50,944 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 16:05:50,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:05:50,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:50,944 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-12-03 16:05:50,944 INFO L423 AbstractCegarLoop]: === Iteration 201 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:50,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:50,945 INFO L82 PathProgramCache]: Analyzing trace with hash -145336531, now seen corresponding path program 198 times [2018-12-03 16:05:50,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:50,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:50,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:50,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:50,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:52,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:52,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:52,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:52,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:52,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:52,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:52,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:52,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:52,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:52,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:52,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:52,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:55,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:55,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 16:05:55,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:55,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:05:55,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:05:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:05:55,924 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-03 16:05:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:56,161 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-12-03 16:05:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:05:56,162 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 16:05:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:56,162 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:05:56,162 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:05:56,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 207 SyntacticMatches, 134 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4489 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:05:56,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:05:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 16:05:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:05:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-12-03 16:05:56,173 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 138 [2018-12-03 16:05:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:56,173 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-12-03 16:05:56,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:05:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-12-03 16:05:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 16:05:56,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:56,174 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1] [2018-12-03 16:05:56,174 INFO L423 AbstractCegarLoop]: === Iteration 202 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:56,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:56,174 INFO L82 PathProgramCache]: Analyzing trace with hash -210526687, now seen corresponding path program 199 times [2018-12-03 16:05:56,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:56,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:56,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:56,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:58,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:58,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:58,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:58,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:58,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:05:58,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:58,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:58,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:58,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:58,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:58,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:58,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:58,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 68 [2018-12-03 16:05:58,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:58,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:05:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:05:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:05:58,610 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 70 states. [2018-12-03 16:06:04,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:04,043 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 16:06:04,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:06:04,043 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 139 [2018-12-03 16:06:04,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:04,044 INFO L225 Difference]: With dead ends: 212 [2018-12-03 16:06:04,044 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 16:06:04,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 340 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:06:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 16:06:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 142. [2018-12-03 16:06:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 16:06:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-12-03 16:06:04,054 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 139 [2018-12-03 16:06:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:04,054 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-12-03 16:06:04,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:06:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2018-12-03 16:06:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 16:06:04,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:04,055 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-12-03 16:06:04,055 INFO L423 AbstractCegarLoop]: === Iteration 203 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:04,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:04,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2063545773, now seen corresponding path program 200 times [2018-12-03 16:06:04,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:04,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:04,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:05,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:05,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:05,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:05,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:05,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:05,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:05,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:05,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:05,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:06:05,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:05,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:05,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 70 [2018-12-03 16:06:09,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:09,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:06:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:06:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:06:09,031 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 71 states. [2018-12-03 16:06:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:09,847 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2018-12-03 16:06:09,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:06:09,848 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-03 16:06:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:09,848 INFO L225 Difference]: With dead ends: 213 [2018-12-03 16:06:09,848 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 16:06:09,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 210 SyntacticMatches, 136 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5092 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:06:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 16:06:09,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 16:06:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 16:06:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 16:06:09,873 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 140 [2018-12-03 16:06:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:09,874 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 16:06:09,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:06:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 16:06:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 16:06:09,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:09,875 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-12-03 16:06:09,875 INFO L423 AbstractCegarLoop]: === Iteration 204 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:09,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1922078137, now seen corresponding path program 201 times [2018-12-03 16:06:09,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:09,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:09,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:09,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:09,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:11,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:11,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:11,641 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:11,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:11,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:11,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:11,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:11,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:11,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:11,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:11,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:11,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 70 [2018-12-03 16:06:14,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:14,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:06:14,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:06:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:06:14,965 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-03 16:06:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:15,191 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-12-03 16:06:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:06:15,192 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-03 16:06:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:15,192 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:06:15,192 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 16:06:15,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 210 SyntacticMatches, 136 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4624 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:06:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 16:06:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 16:06:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 16:06:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-03 16:06:15,205 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-12-03 16:06:15,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:15,205 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-03 16:06:15,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:06:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-03 16:06:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 16:06:15,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:15,206 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1] [2018-12-03 16:06:15,206 INFO L423 AbstractCegarLoop]: === Iteration 205 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:15,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash 545058375, now seen corresponding path program 202 times [2018-12-03 16:06:15,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:15,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:15,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:15,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:17,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:17,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:17,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:17,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:17,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:17,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:17,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:17,506 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:17,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:17,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:17,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 16:06:17,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:17,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:06:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:06:17,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:06:17,697 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 71 states. [2018-12-03 16:06:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:23,317 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2018-12-03 16:06:23,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:06:23,317 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 141 [2018-12-03 16:06:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:23,318 INFO L225 Difference]: With dead ends: 215 [2018-12-03 16:06:23,318 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 16:06:23,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:06:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 16:06:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 144. [2018-12-03 16:06:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 16:06:23,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-12-03 16:06:23,329 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 141 [2018-12-03 16:06:23,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:23,329 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-12-03 16:06:23,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:06:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-12-03 16:06:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:06:23,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:23,329 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-12-03 16:06:23,330 INFO L423 AbstractCegarLoop]: === Iteration 206 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:23,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash -283121081, now seen corresponding path program 203 times [2018-12-03 16:06:23,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:23,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:23,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:23,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:25,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:25,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:25,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:25,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:25,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:25,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:25,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:25,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:25,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:06:25,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:25,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:25,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 16:06:28,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:28,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:06:28,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:06:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:06:28,499 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 72 states. [2018-12-03 16:06:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:29,095 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2018-12-03 16:06:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:06:29,096 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 16:06:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:29,096 INFO L225 Difference]: With dead ends: 216 [2018-12-03 16:06:29,096 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:06:29,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 213 SyntacticMatches, 138 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5236 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:06:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:06:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 16:06:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 16:06:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-03 16:06:29,107 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 142 [2018-12-03 16:06:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:29,107 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-03 16:06:29,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:06:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-03 16:06:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:06:29,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:29,108 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-12-03 16:06:29,108 INFO L423 AbstractCegarLoop]: === Iteration 207 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:29,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash 716589293, now seen corresponding path program 204 times [2018-12-03 16:06:29,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:29,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:29,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:29,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:30,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:30,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:30,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:30,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:30,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:30,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:30,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:30,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:31,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:31,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:31,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:31,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:34,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:34,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 16:06:34,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:34,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:06:34,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:06:34,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:06:34,358 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-03 16:06:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:34,643 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-12-03 16:06:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:06:34,644 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 16:06:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:34,644 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:06:34,645 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 16:06:34,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 213 SyntacticMatches, 138 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4761 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:06:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 16:06:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 16:06:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 16:06:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-03 16:06:34,659 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 142 [2018-12-03 16:06:34,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:34,659 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-03 16:06:34,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:06:34,659 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-03 16:06:34,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 16:06:34,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:34,660 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1] [2018-12-03 16:06:34,660 INFO L423 AbstractCegarLoop]: === Iteration 208 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:34,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash 739370081, now seen corresponding path program 205 times [2018-12-03 16:06:34,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:34,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:34,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:34,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:37,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:37,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:37,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:37,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:37,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:37,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:37,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:37,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:37,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:37,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:37,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:37,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:37,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 70 [2018-12-03 16:06:37,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:37,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:06:37,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:06:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:06:37,368 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 72 states. [2018-12-03 16:06:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:43,205 INFO L93 Difference]: Finished difference Result 218 states and 220 transitions. [2018-12-03 16:06:43,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:06:43,206 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 143 [2018-12-03 16:06:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:43,207 INFO L225 Difference]: With dead ends: 218 [2018-12-03 16:06:43,207 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 16:06:43,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:06:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 16:06:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 146. [2018-12-03 16:06:43,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 16:06:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-12-03 16:06:43,222 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 143 [2018-12-03 16:06:43,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:43,222 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-12-03 16:06:43,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:06:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-12-03 16:06:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 16:06:43,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:43,223 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-12-03 16:06:43,223 INFO L423 AbstractCegarLoop]: === Iteration 209 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:43,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:43,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1445574509, now seen corresponding path program 206 times [2018-12-03 16:06:43,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:43,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:45,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:45,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:45,091 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:45,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:45,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:45,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:45,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:06:45,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:06:45,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:06:45,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:45,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:45,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:48,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:48,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 72 [2018-12-03 16:06:48,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:48,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:06:48,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:06:48,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:06:48,562 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 73 states. [2018-12-03 16:06:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:49,441 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2018-12-03 16:06:49,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:06:49,442 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 16:06:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:49,442 INFO L225 Difference]: With dead ends: 219 [2018-12-03 16:06:49,443 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 16:06:49,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 216 SyntacticMatches, 140 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5382 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:06:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 16:06:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 16:06:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 16:06:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 16:06:49,453 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 144 [2018-12-03 16:06:49,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:49,453 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 16:06:49,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:06:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 16:06:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 16:06:49,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:49,454 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-12-03 16:06:49,454 INFO L423 AbstractCegarLoop]: === Iteration 210 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:49,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:49,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1923142265, now seen corresponding path program 207 times [2018-12-03 16:06:49,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:49,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:49,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:49,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:51,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:51,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:51,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:51,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:51,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:51,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:51,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:06:51,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:06:51,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:06:51,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:06:51,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:51,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:54,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:54,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 72 [2018-12-03 16:06:54,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:54,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:06:54,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:06:54,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:06:54,846 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-03 16:06:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:06:55,156 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-12-03 16:06:55,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:06:55,157 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 16:06:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:06:55,157 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:06:55,157 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 16:06:55,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 216 SyntacticMatches, 140 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:06:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 16:06:55,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 16:06:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 16:06:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-12-03 16:06:55,167 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 144 [2018-12-03 16:06:55,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:06:55,167 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-12-03 16:06:55,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:06:55,168 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-12-03 16:06:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 16:06:55,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:06:55,168 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1] [2018-12-03 16:06:55,168 INFO L423 AbstractCegarLoop]: === Iteration 211 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:06:55,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:06:55,168 INFO L82 PathProgramCache]: Analyzing trace with hash 512070407, now seen corresponding path program 208 times [2018-12-03 16:06:55,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:06:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:55,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:06:55,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:06:55,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:06:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:57,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:57,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:06:57,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:06:57,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:06:57,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:06:57,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:06:57,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:06:57,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:06:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:06:57,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:06:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:57,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:06:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:06:57,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:06:57,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 16:06:57,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:06:57,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:06:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:06:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:06:57,761 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 73 states. [2018-12-03 16:07:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:03,706 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-12-03 16:07:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:07:03,706 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 145 [2018-12-03 16:07:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:03,707 INFO L225 Difference]: With dead ends: 221 [2018-12-03 16:07:03,707 INFO L226 Difference]: Without dead ends: 218 [2018-12-03 16:07:03,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 355 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:07:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-03 16:07:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-12-03 16:07:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:07:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-12-03 16:07:03,718 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 145 [2018-12-03 16:07:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:03,718 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-12-03 16:07:03,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:07:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-12-03 16:07:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:07:03,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:03,719 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-12-03 16:07:03,719 INFO L423 AbstractCegarLoop]: === Iteration 212 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:03,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:03,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1305748089, now seen corresponding path program 209 times [2018-12-03 16:07:03,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:03,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:03,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:03,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:03,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:05,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:05,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:05,540 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:05,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:05,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:05,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:05,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:07:05,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:07:05,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:07:05,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:05,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:05,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:09,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:09,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 16:07:09,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:09,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:07:09,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:07:09,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:07:09,117 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 74 states. [2018-12-03 16:07:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:09,693 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-12-03 16:07:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:07:09,694 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 16:07:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:09,694 INFO L225 Difference]: With dead ends: 222 [2018-12-03 16:07:09,695 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:07:09,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 219 SyntacticMatches, 142 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5530 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:07:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:07:09,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 16:07:09,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:07:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 16:07:09,705 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 146 [2018-12-03 16:07:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:09,705 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 16:07:09,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:07:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 16:07:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:07:09,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:09,706 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-12-03 16:07:09,706 INFO L423 AbstractCegarLoop]: === Iteration 213 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:09,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1638214317, now seen corresponding path program 210 times [2018-12-03 16:07:09,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:09,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:09,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:11,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:11,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:11,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:11,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:11,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:11,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:11,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:11,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:07:11,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:07:11,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:07:11,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:11,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:11,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:11,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:15,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:15,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 16:07:15,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:15,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:07:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:07:15,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:07:15,243 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-03 16:07:15,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:15,484 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2018-12-03 16:07:15,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:07:15,484 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 16:07:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:15,485 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:07:15,485 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 16:07:15,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 219 SyntacticMatches, 142 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:07:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 16:07:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 16:07:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:07:15,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-12-03 16:07:15,496 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-12-03 16:07:15,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:15,496 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-12-03 16:07:15,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:07:15,496 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-12-03 16:07:15,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 16:07:15,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:15,496 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1] [2018-12-03 16:07:15,497 INFO L423 AbstractCegarLoop]: === Iteration 214 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:15,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:15,497 INFO L82 PathProgramCache]: Analyzing trace with hash -755025247, now seen corresponding path program 211 times [2018-12-03 16:07:15,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:15,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:15,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:15,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:17,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:17,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:17,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:17,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:17,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:17,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:17,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:17,974 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:07:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:18,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:18,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:18,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:18,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 72 [2018-12-03 16:07:18,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:18,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:07:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:07:18,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:07:18,175 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 74 states. [2018-12-03 16:07:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:24,266 INFO L93 Difference]: Finished difference Result 224 states and 226 transitions. [2018-12-03 16:07:24,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:07:24,266 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 147 [2018-12-03 16:07:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:24,267 INFO L225 Difference]: With dead ends: 224 [2018-12-03 16:07:24,267 INFO L226 Difference]: Without dead ends: 221 [2018-12-03 16:07:24,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 360 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:07:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-03 16:07:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 150. [2018-12-03 16:07:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 16:07:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 16:07:24,279 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 147 [2018-12-03 16:07:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:24,279 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 16:07:24,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:07:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 16:07:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 16:07:24,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:24,279 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-12-03 16:07:24,279 INFO L423 AbstractCegarLoop]: === Iteration 215 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:24,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1931007699, now seen corresponding path program 212 times [2018-12-03 16:07:24,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:24,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:24,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:24,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:24,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:26,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:26,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:26,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:26,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:26,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:26,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:26,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:07:26,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:07:26,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:07:26,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:26,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:26,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:29,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:29,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 74 [2018-12-03 16:07:29,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:29,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:07:29,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:07:29,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:07:29,857 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 75 states. [2018-12-03 16:07:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:30,781 INFO L93 Difference]: Finished difference Result 225 states and 227 transitions. [2018-12-03 16:07:30,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:07:30,782 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 16:07:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:30,782 INFO L225 Difference]: With dead ends: 225 [2018-12-03 16:07:30,782 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 16:07:30,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 222 SyntacticMatches, 144 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5680 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:07:30,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 16:07:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 16:07:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 16:07:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-03 16:07:30,793 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 148 [2018-12-03 16:07:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:30,793 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-03 16:07:30,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:07:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-03 16:07:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 16:07:30,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:30,794 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-12-03 16:07:30,794 INFO L423 AbstractCegarLoop]: === Iteration 216 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:30,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:30,794 INFO L82 PathProgramCache]: Analyzing trace with hash -862486329, now seen corresponding path program 213 times [2018-12-03 16:07:30,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:30,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:30,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:30,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:32,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:32,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:32,790 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:32,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:32,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:32,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:32,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:07:32,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:07:32,881 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:07:32,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:32,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:32,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:36,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:36,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 74 [2018-12-03 16:07:36,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:36,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:07:36,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:07:36,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:07:36,490 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-03 16:07:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:36,757 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-12-03 16:07:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:07:36,758 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 16:07:36,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:36,758 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:07:36,759 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 16:07:36,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 222 SyntacticMatches, 144 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5184 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:07:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 16:07:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 16:07:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 16:07:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-03 16:07:36,770 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 148 [2018-12-03 16:07:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:36,770 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-03 16:07:36,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:07:36,771 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-03 16:07:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 16:07:36,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:36,771 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1] [2018-12-03 16:07:36,771 INFO L423 AbstractCegarLoop]: === Iteration 217 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:36,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:36,771 INFO L82 PathProgramCache]: Analyzing trace with hash -967333945, now seen corresponding path program 214 times [2018-12-03 16:07:36,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:36,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:36,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:36,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:39,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:39,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:39,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:39,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:39,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:39,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:39,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:39,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:07:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:39,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:39,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:39,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:39,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:39,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 16:07:39,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:39,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:07:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:07:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:07:39,516 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 75 states. [2018-12-03 16:07:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:45,800 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-12-03 16:07:45,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:07:45,800 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 149 [2018-12-03 16:07:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:45,801 INFO L225 Difference]: With dead ends: 227 [2018-12-03 16:07:45,801 INFO L226 Difference]: Without dead ends: 224 [2018-12-03 16:07:45,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 365 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:07:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-03 16:07:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2018-12-03 16:07:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 16:07:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-12-03 16:07:45,817 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 149 [2018-12-03 16:07:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:45,817 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-12-03 16:07:45,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:07:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-12-03 16:07:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:07:45,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:45,818 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-12-03 16:07:45,818 INFO L423 AbstractCegarLoop]: === Iteration 218 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:45,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:45,819 INFO L82 PathProgramCache]: Analyzing trace with hash 77357255, now seen corresponding path program 215 times [2018-12-03 16:07:45,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:45,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:45,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:07:45,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:45,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:47,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:47,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:47,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:47,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:47,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:47,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:47,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:07:47,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:07:48,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:07:48,014 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:48,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:48,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:51,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:51,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 16:07:51,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:51,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:07:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:07:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:07:51,660 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 76 states. [2018-12-03 16:07:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:52,439 INFO L93 Difference]: Finished difference Result 228 states and 230 transitions. [2018-12-03 16:07:52,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:07:52,440 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 16:07:52,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:52,441 INFO L225 Difference]: With dead ends: 228 [2018-12-03 16:07:52,441 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:07:52,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 225 SyntacticMatches, 146 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5832 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:07:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:07:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 16:07:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 16:07:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 16:07:52,456 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 150 [2018-12-03 16:07:52,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:52,456 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 16:07:52,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:07:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 16:07:52,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:07:52,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:52,457 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-12-03 16:07:52,457 INFO L423 AbstractCegarLoop]: === Iteration 219 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:52,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:52,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1158218643, now seen corresponding path program 216 times [2018-12-03 16:07:52,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:52,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:52,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:52,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:52,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:07:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:55,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:55,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:07:55,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:07:55,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:07:55,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:07:55,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:07:55,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:07:55,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:07:55,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:07:55,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:07:55,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:07:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:55,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:07:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:07:59,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:07:59,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 16:07:59,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:07:59,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:07:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:07:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:07:59,156 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-03 16:07:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:07:59,405 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-12-03 16:07:59,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:07:59,406 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 16:07:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:07:59,406 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:07:59,406 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 16:07:59,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 225 SyntacticMatches, 146 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5329 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:07:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 16:07:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 16:07:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 16:07:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-12-03 16:07:59,428 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 150 [2018-12-03 16:07:59,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:07:59,428 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-12-03 16:07:59,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:07:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-12-03 16:07:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 16:07:59,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:07:59,429 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1] [2018-12-03 16:07:59,429 INFO L423 AbstractCegarLoop]: === Iteration 220 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:07:59,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:07:59,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1545101087, now seen corresponding path program 217 times [2018-12-03 16:07:59,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:07:59,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:59,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:07:59,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:07:59,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:07:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:02,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:02,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:02,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:02,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:02,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:02,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:02,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:08:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:02,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:02,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:02,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:02,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 74 [2018-12-03 16:08:02,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:02,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:08:02,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:08:02,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:08:02,255 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 76 states. [2018-12-03 16:08:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:08,671 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2018-12-03 16:08:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:08:08,671 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 151 [2018-12-03 16:08:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:08,672 INFO L225 Difference]: With dead ends: 230 [2018-12-03 16:08:08,672 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 16:08:08,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:08:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 16:08:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 154. [2018-12-03 16:08:08,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 16:08:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-12-03 16:08:08,684 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 151 [2018-12-03 16:08:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:08,684 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-12-03 16:08:08,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:08:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2018-12-03 16:08:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 16:08:08,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:08,685 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-12-03 16:08:08,685 INFO L423 AbstractCegarLoop]: === Iteration 221 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:08,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:08,685 INFO L82 PathProgramCache]: Analyzing trace with hash -653554963, now seen corresponding path program 218 times [2018-12-03 16:08:08,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:08,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:08,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:08,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:08,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:10,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:10,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:10,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:10,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:10,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:10,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:10,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:08:10,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:08:10,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:08:10,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:10,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:10,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:10,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:14,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:14,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 76 [2018-12-03 16:08:14,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:14,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:08:14,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:08:14,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:08:14,579 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 77 states. [2018-12-03 16:08:15,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:15,540 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2018-12-03 16:08:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:08:15,540 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-03 16:08:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:15,541 INFO L225 Difference]: With dead ends: 231 [2018-12-03 16:08:15,541 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 16:08:15,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 228 SyntacticMatches, 148 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5986 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:08:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 16:08:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 16:08:15,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 16:08:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 16:08:15,551 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 152 [2018-12-03 16:08:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:15,551 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 16:08:15,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:08:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 16:08:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 16:08:15,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:15,552 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-12-03 16:08:15,552 INFO L423 AbstractCegarLoop]: === Iteration 222 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:15,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:15,552 INFO L82 PathProgramCache]: Analyzing trace with hash -301702137, now seen corresponding path program 219 times [2018-12-03 16:08:15,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:15,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:15,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:15,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:17,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:17,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:17,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:17,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:17,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:17,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:17,627 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:08:17,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:08:17,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:08:17,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:17,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:17,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:21,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:21,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 76 [2018-12-03 16:08:21,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:21,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:08:21,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:08:21,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:08:21,524 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-03 16:08:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:21,784 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-12-03 16:08:21,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:08:21,784 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-03 16:08:21,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:21,785 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:08:21,785 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 16:08:21,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 228 SyntacticMatches, 148 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5476 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:08:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 16:08:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 16:08:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 16:08:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-12-03 16:08:21,796 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-12-03 16:08:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:21,797 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-12-03 16:08:21,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:08:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-12-03 16:08:21,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 16:08:21,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:21,797 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1] [2018-12-03 16:08:21,797 INFO L423 AbstractCegarLoop]: === Iteration 223 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:21,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:21,798 INFO L82 PathProgramCache]: Analyzing trace with hash -762893177, now seen corresponding path program 220 times [2018-12-03 16:08:21,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:21,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:21,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:21,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:24,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:24,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:24,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:24,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:24,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:24,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:24,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:24,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:08:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:24,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:24,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:24,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:24,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:24,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 16:08:24,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:24,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:08:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:08:24,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:08:24,771 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 77 states. [2018-12-03 16:08:31,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:31,371 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-12-03 16:08:31,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:08:31,371 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 153 [2018-12-03 16:08:31,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:31,372 INFO L225 Difference]: With dead ends: 233 [2018-12-03 16:08:31,372 INFO L226 Difference]: Without dead ends: 230 [2018-12-03 16:08:31,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 375 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:08:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-03 16:08:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2018-12-03 16:08:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 16:08:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-12-03 16:08:31,384 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 153 [2018-12-03 16:08:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:31,385 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-12-03 16:08:31,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:08:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-12-03 16:08:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 16:08:31,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:31,385 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-12-03 16:08:31,385 INFO L423 AbstractCegarLoop]: === Iteration 224 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:31,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2120053767, now seen corresponding path program 221 times [2018-12-03 16:08:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:31,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:31,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:33,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:33,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:33,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:33,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:33,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:33,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:33,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:08:33,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:08:33,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 16:08:33,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:33,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:33,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:37,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:37,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 16:08:37,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:37,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:08:37,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:08:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:08:37,360 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 78 states. [2018-12-03 16:08:38,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:38,345 INFO L93 Difference]: Finished difference Result 234 states and 236 transitions. [2018-12-03 16:08:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:08:38,346 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 16:08:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:38,346 INFO L225 Difference]: With dead ends: 234 [2018-12-03 16:08:38,346 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:08:38,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 231 SyntacticMatches, 150 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6142 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:08:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:08:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 16:08:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 16:08:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-03 16:08:38,357 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 154 [2018-12-03 16:08:38,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:38,358 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-03 16:08:38,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:08:38,358 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-03 16:08:38,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 16:08:38,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:38,359 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-12-03 16:08:38,359 INFO L423 AbstractCegarLoop]: === Iteration 225 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:38,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash 142589485, now seen corresponding path program 222 times [2018-12-03 16:08:38,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:38,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:38,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:40,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:40,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:40,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:40,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:40,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:40,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:40,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:08:40,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:08:40,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:08:40,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:40,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:40,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:44,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 16:08:44,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:44,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:08:44,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:08:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:08:44,465 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-03 16:08:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:44,729 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-12-03 16:08:44,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:08:44,729 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 16:08:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:44,730 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:08:44,730 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 16:08:44,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 231 SyntacticMatches, 150 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:08:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 16:08:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 16:08:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 16:08:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-12-03 16:08:44,742 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 154 [2018-12-03 16:08:44,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:44,742 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-12-03 16:08:44,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:08:44,742 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-12-03 16:08:44,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 16:08:44,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:44,743 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1] [2018-12-03 16:08:44,743 INFO L423 AbstractCegarLoop]: === Iteration 226 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:44,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:44,743 INFO L82 PathProgramCache]: Analyzing trace with hash 125245217, now seen corresponding path program 223 times [2018-12-03 16:08:44,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:44,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:44,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:44,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:47,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:47,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:47,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:47,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:47,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:47,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:47,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:47,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:08:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:47,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:47,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:47,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:47,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:47,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 76 [2018-12-03 16:08:47,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:47,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:08:47,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:08:47,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:08:47,648 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 78 states. [2018-12-03 16:08:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:54,376 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2018-12-03 16:08:54,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:08:54,377 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 155 [2018-12-03 16:08:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:54,377 INFO L225 Difference]: With dead ends: 236 [2018-12-03 16:08:54,377 INFO L226 Difference]: Without dead ends: 233 [2018-12-03 16:08:54,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 380 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:08:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-03 16:08:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 158. [2018-12-03 16:08:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 16:08:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-12-03 16:08:54,389 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 155 [2018-12-03 16:08:54,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:54,389 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-12-03 16:08:54,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:08:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-12-03 16:08:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 16:08:54,390 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:54,390 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-12-03 16:08:54,390 INFO L423 AbstractCegarLoop]: === Iteration 227 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:54,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -412427091, now seen corresponding path program 224 times [2018-12-03 16:08:54,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:54,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:54,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:54,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:56,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:56,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:56,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:56,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:56,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:56,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:08:56,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:08:56,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:08:56,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 16:08:56,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:56,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:56,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:00,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:00,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 78 [2018-12-03 16:09:00,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:00,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:09:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:09:00,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:09:00,542 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 79 states. [2018-12-03 16:09:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:01,173 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-12-03 16:09:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:09:01,173 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 16:09:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:01,174 INFO L225 Difference]: With dead ends: 237 [2018-12-03 16:09:01,174 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 16:09:01,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 234 SyntacticMatches, 152 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6300 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:09:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 16:09:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 16:09:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 16:09:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 16:09:01,186 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 156 [2018-12-03 16:09:01,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:01,186 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 16:09:01,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:09:01,186 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 16:09:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 16:09:01,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:01,187 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-12-03 16:09:01,187 INFO L423 AbstractCegarLoop]: === Iteration 228 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:01,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:01,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1584277689, now seen corresponding path program 225 times [2018-12-03 16:09:01,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:01,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:01,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:09:01,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:01,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:03,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:03,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:03,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:03,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:03,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:03,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:03,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:09:03,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:09:03,459 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:09:03,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:09:03,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:03,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:07,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:07,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 78 [2018-12-03 16:09:07,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:07,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:09:07,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:09:07,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:09:07,443 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-03 16:09:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:07,705 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-12-03 16:09:07,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:09:07,706 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 16:09:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:07,706 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:09:07,706 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 16:09:07,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 234 SyntacticMatches, 152 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5776 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:09:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 16:09:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 16:09:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 16:09:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-12-03 16:09:07,719 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 156 [2018-12-03 16:09:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:07,719 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-12-03 16:09:07,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:09:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-12-03 16:09:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 16:09:07,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:07,720 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1] [2018-12-03 16:09:07,720 INFO L423 AbstractCegarLoop]: === Iteration 229 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:07,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1868029625, now seen corresponding path program 226 times [2018-12-03 16:09:07,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:07,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:07,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:09:07,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:07,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:10,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:10,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:10,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:10,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:10,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:10,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:10,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:10,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:09:10,462 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:09:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:10,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:10,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:10,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:10,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 16:09:10,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:10,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:09:10,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:09:10,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:09:10,671 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 79 states. [2018-12-03 16:09:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:17,588 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-12-03 16:09:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:09:17,588 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 157 [2018-12-03 16:09:17,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:17,589 INFO L225 Difference]: With dead ends: 239 [2018-12-03 16:09:17,589 INFO L226 Difference]: Without dead ends: 236 [2018-12-03 16:09:17,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 385 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 16:09:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-03 16:09:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 160. [2018-12-03 16:09:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:09:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-12-03 16:09:17,601 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2018-12-03 16:09:17,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:17,602 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-12-03 16:09:17,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:09:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-12-03 16:09:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:09:17,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:17,602 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-12-03 16:09:17,602 INFO L423 AbstractCegarLoop]: === Iteration 230 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:17,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:17,603 INFO L82 PathProgramCache]: Analyzing trace with hash -2074405049, now seen corresponding path program 227 times [2018-12-03 16:09:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:17,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:09:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:17,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:19,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:19,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:19,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:19,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:19,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:19,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:19,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:09:19,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:09:19,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:09:19,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:09:19,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:19,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:23,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 16:09:23,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:23,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:09:23,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:09:23,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:09:23,952 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 80 states. [2018-12-03 16:09:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:24,614 INFO L93 Difference]: Finished difference Result 240 states and 242 transitions. [2018-12-03 16:09:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:09:24,614 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 16:09:24,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:24,615 INFO L225 Difference]: With dead ends: 240 [2018-12-03 16:09:24,615 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:09:24,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 237 SyntacticMatches, 154 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6460 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:09:24,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:09:24,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 16:09:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 16:09:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 16:09:24,627 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 158 [2018-12-03 16:09:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:24,627 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 16:09:24,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:09:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 16:09:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:09:24,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:24,628 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-12-03 16:09:24,628 INFO L423 AbstractCegarLoop]: === Iteration 231 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:24,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:24,628 INFO L82 PathProgramCache]: Analyzing trace with hash 252932077, now seen corresponding path program 228 times [2018-12-03 16:09:24,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:24,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:24,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:09:24,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:24,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:26,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:26,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:26,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:26,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:26,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:26,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:26,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:09:26,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:09:26,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:09:26,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:09:26,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:26,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:31,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:31,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 16:09:31,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:31,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:09:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:09:31,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:09:31,033 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-03 16:09:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:31,297 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-12-03 16:09:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:09:31,297 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 16:09:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:31,298 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:09:31,298 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 16:09:31,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 237 SyntacticMatches, 154 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5929 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:09:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 16:09:31,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 16:09:31,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:09:31,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-03 16:09:31,310 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-12-03 16:09:31,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:31,311 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-03 16:09:31,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:09:31,311 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-03 16:09:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:09:31,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:31,311 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1] [2018-12-03 16:09:31,311 INFO L423 AbstractCegarLoop]: === Iteration 232 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:31,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:31,311 INFO L82 PathProgramCache]: Analyzing trace with hash -749101727, now seen corresponding path program 229 times [2018-12-03 16:09:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:31,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:09:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:31,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:34,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:34,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:34,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:34,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:34,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:34,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:09:34,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:09:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:34,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:34,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:34,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:34,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 78 [2018-12-03 16:09:34,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:34,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:09:34,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:09:34,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:09:34,342 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 80 states. [2018-12-03 16:09:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:41,419 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-12-03 16:09:41,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:09:41,420 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 159 [2018-12-03 16:09:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:41,420 INFO L225 Difference]: With dead ends: 242 [2018-12-03 16:09:41,420 INFO L226 Difference]: Without dead ends: 239 [2018-12-03 16:09:41,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 390 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:09:41,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-03 16:09:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 162. [2018-12-03 16:09:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 16:09:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-12-03 16:09:41,433 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 159 [2018-12-03 16:09:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:41,433 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-12-03 16:09:41,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:09:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-12-03 16:09:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 16:09:41,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:41,434 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-12-03 16:09:41,434 INFO L423 AbstractCegarLoop]: === Iteration 233 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:41,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1747378579, now seen corresponding path program 230 times [2018-12-03 16:09:41,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:41,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:09:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:41,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:43,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:43,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:43,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:43,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:43,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:43,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:43,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:09:43,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:09:43,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:09:43,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:09:43,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:43,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:47,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:47,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 80 [2018-12-03 16:09:47,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:47,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:09:47,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:09:47,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:09:47,881 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 81 states. [2018-12-03 16:09:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:48,964 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-12-03 16:09:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:09:48,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 16:09:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:48,965 INFO L225 Difference]: With dead ends: 243 [2018-12-03 16:09:48,965 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 16:09:48,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 240 SyntacticMatches, 156 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:09:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 16:09:48,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 16:09:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:09:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-03 16:09:48,978 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 160 [2018-12-03 16:09:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:48,978 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-03 16:09:48,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:09:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-03 16:09:48,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 16:09:48,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:48,979 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-12-03 16:09:48,979 INFO L423 AbstractCegarLoop]: === Iteration 234 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:48,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1680595591, now seen corresponding path program 231 times [2018-12-03 16:09:48,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:48,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:48,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:09:48,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:48,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:51,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:51,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:51,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:51,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:51,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:51,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:51,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:09:51,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:09:51,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:09:51,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:09:51,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:51,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:55,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 80 [2018-12-03 16:09:55,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:55,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:09:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:09:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:09:55,578 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-03 16:09:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:09:55,889 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-12-03 16:09:55,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:09:55,889 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 16:09:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:09:55,890 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:09:55,890 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 16:09:55,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 240 SyntacticMatches, 156 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6084 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:09:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 16:09:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 16:09:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 16:09:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-12-03 16:09:55,907 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 160 [2018-12-03 16:09:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:09:55,908 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-12-03 16:09:55,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:09:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-12-03 16:09:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 16:09:55,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:09:55,909 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1] [2018-12-03 16:09:55,909 INFO L423 AbstractCegarLoop]: === Iteration 235 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:09:55,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:09:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash 558794247, now seen corresponding path program 232 times [2018-12-03 16:09:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:09:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:55,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:09:55,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:09:55,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:09:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:59,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:59,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:09:59,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:09:59,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:09:59,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:09:59,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:09:59,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:09:59,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:09:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:09:59,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:09:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:59,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:09:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:09:59,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:09:59,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 16:09:59,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:09:59,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:09:59,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:09:59,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:09:59,251 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 81 states. [2018-12-03 16:10:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:10:06,559 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-12-03 16:10:06,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:10:06,560 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 161 [2018-12-03 16:10:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:10:06,560 INFO L225 Difference]: With dead ends: 245 [2018-12-03 16:10:06,561 INFO L226 Difference]: Without dead ends: 242 [2018-12-03 16:10:06,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 395 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:10:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-03 16:10:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 164. [2018-12-03 16:10:06,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 16:10:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-03 16:10:06,574 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 161 [2018-12-03 16:10:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:10:06,574 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-03 16:10:06,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:10:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-03 16:10:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:10:06,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:10:06,575 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-12-03 16:10:06,575 INFO L423 AbstractCegarLoop]: === Iteration 236 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:10:06,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:10:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash 142690951, now seen corresponding path program 233 times [2018-12-03 16:10:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:10:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:06,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:10:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:06,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:10:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat