java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:36:02,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:36:02,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:36:02,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:36:02,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:36:02,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:36:02,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:36:02,472 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:36:02,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:36:02,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:36:02,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:36:02,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:36:02,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:36:02,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:36:02,479 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:36:02,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:36:02,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:36:02,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:36:02,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:36:02,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:36:02,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:36:02,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:36:02,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:36:02,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:36:02,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:36:02,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:36:02,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:36:02,496 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:36:02,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:36:02,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:36:02,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:36:02,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:36:02,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:36:02,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:36:02,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:36:02,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:36:02,502 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:36:02,522 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:36:02,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:36:02,526 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:36:02,526 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:36:02,526 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:36:02,526 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:36:02,527 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:36:02,527 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:36:02,527 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:36:02,527 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:36:02,527 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:36:02,528 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:36:02,528 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:36:02,528 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:36:02,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:36:02,529 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:36:02,529 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:36:02,531 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:36:02,531 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:36:02,532 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:36:02,532 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:36:02,532 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:36:02,532 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:36:02,532 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:36:02,533 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:36:02,533 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:36:02,533 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:36:02,534 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:36:02,534 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:36:02,534 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:36:02,534 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:36:02,534 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:36:02,535 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:36:02,536 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:36:02,536 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:36:02,536 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:36:02,536 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:36:02,536 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:36:02,537 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:36:02,537 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:36:02,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:36:02,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:36:02,617 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:36:02,619 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:36:02,619 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:36:02,620 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl [2018-12-03 19:36:02,621 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl' [2018-12-03 19:36:02,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:36:02,662 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:36:02,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:36:02,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:36:02,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:36:02,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,700 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 19:36:02,701 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 19:36:02,701 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 19:36:02,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:36:02,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:36:02,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:36:02,705 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:36:02,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/1) ... [2018-12-03 19:36:02,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:36:02,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:36:02,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:36:02,731 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:36:02,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (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 19:36:02,816 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 19:36:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 19:36:02,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 19:36:03,061 INFO L272 CfgBuilder]: Using library mode [2018-12-03 19:36:03,061 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:36:03,062 INFO L202 PluginConnector]: Adding new model Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:03 BoogieIcfgContainer [2018-12-03 19:36:03,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:36:03,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:36:03,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:36:03,070 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:36:03,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:36:02" (1/2) ... [2018-12-03 19:36:03,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ceb053 and model type Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:36:03, skipping insertion in model container [2018-12-03 19:36:03,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:36:03" (2/2) ... [2018-12-03 19:36:03,073 INFO L112 eAbstractionObserver]: Analyzing ICFG Octopussy.bpl [2018-12-03 19:36:03,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:36:03,094 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:36:03,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:36:03,155 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:36:03,156 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:36:03,156 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:36:03,156 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:36:03,156 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:36:03,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:36:03,158 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:36:03,158 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:36:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 19:36:03,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 19:36:03,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:03,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 19:36:03,196 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:03,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:03,203 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 19:36:03,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:03,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:03,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:03,348 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 19:36:03,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:36:03,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:36:03,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:36:03,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:36:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:36:03,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:36:03,373 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 19:36:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:03,413 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 19:36:03,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:36:03,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 19:36:03,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:03,427 INFO L225 Difference]: With dead ends: 13 [2018-12-03 19:36:03,427 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 19:36:03,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:36:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 19:36:03,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 19:36:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 19:36:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 19:36:03,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 19:36:03,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:03,469 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 19:36:03,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:36:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 19:36:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 19:36:03,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:03,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 19:36:03,470 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:03,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:03,471 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 19:36:03,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:03,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:03,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:03,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:03,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:03,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:03,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:03,615 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 19:36:03,617 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 19:36:03,695 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:36:03,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:36:03,850 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:36:03,852 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 15 times. Widened at 1 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 19:36:03,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:03,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:36:03,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:03,865 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 19:36:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:03,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:03,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:03,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:04,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:04,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 19:36:04,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:04,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:36:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:36:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:36:04,014 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 19:36:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:04,049 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 19:36:04,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 19:36:04,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 19:36:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:04,051 INFO L225 Difference]: With dead ends: 8 [2018-12-03 19:36:04,051 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 19:36:04,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:36:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 19:36:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 19:36:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 19:36:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 19:36:04,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 19:36:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:04,056 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 19:36:04,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:36:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 19:36:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 19:36:04,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:04,057 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 19:36:04,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:04,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 19:36:04,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:04,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:04,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:04,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:04,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:04,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:04,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:04,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:04,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:04,117 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 19:36:04,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:04,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:04,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 19:36:04,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:04,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:04,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:04,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:04,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:04,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 19:36:04,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:04,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 19:36:04,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 19:36:04,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:36:04,263 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 19:36:04,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:04,323 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 19:36:04,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:36:04,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 19:36:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:04,325 INFO L225 Difference]: With dead ends: 9 [2018-12-03 19:36:04,325 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 19:36:04,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:36:04,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 19:36:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 19:36:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 19:36:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 19:36:04,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 19:36:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:04,330 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 19:36:04,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 19:36:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 19:36:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 19:36:04,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:04,331 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 19:36:04,332 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:04,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 19:36:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:04,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:04,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:04,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:04,438 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 19:36:04,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:04,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:04,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:04,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 19:36:04,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:04,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 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 19:36:04,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:04,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:04,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:04,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:04,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:04,497 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 19:36:04,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:04,728 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 19:36:04,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 19:36:04,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:04,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 19:36:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 19:36:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:36:04,750 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 19:36:04,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:04,822 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 19:36:04,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 19:36:04,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 19:36:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:04,823 INFO L225 Difference]: With dead ends: 10 [2018-12-03 19:36:04,824 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 19:36:04,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:36:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 19:36:04,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 19:36:04,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 19:36:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 19:36:04,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 19:36:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:04,828 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 19:36:04,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 19:36:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 19:36:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 19:36:04,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:04,829 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 19:36:04,829 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:04,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:04,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 19:36:04,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:04,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:04,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:04,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:04,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:04,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:04,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:04,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:04,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:04,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:04,960 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 19:36:04,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:04,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:05,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:05,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:05,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:05,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:05,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 19:36:05,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:05,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:36:05,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:36:05,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 19:36:05,187 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 19:36:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:05,210 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 19:36:05,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 19:36:05,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 19:36:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:05,212 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:36:05,212 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 19:36:05,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 19:36:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 19:36:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 19:36:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 19:36:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 19:36:05,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 19:36:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:05,218 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 19:36:05,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:36:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 19:36:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 19:36:05,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:05,219 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 19:36:05,219 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:05,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:05,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 19:36:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:05,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:05,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:05,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:05,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:05,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:05,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:05,320 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 19:36:05,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:05,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:05,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 19:36:05,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:05,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:05,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:05,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:05,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 19:36:05,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:05,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:36:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:36:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:36:05,822 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 19:36:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:05,843 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 19:36:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 19:36:05,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 19:36:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:05,844 INFO L225 Difference]: With dead ends: 12 [2018-12-03 19:36:05,844 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 19:36:05,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:36:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 19:36:05,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 19:36:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 19:36:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 19:36:05,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 19:36:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:05,848 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 19:36:05,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:36:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 19:36:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 19:36:05,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:05,849 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 19:36:05,849 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:05,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 19:36:05,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:05,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:05,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:05,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:05,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:05,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:05,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:05,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:05,983 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 19:36:05,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:05,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:06,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:06,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:06,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:06,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 19:36:06,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:06,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 19:36:06,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 19:36:06,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 19:36:06,155 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 19:36:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:06,190 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 19:36:06,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:36:06,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 19:36:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:06,191 INFO L225 Difference]: With dead ends: 13 [2018-12-03 19:36:06,192 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 19:36:06,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 19:36:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 19:36:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 19:36:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 19:36:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 19:36:06,195 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 19:36:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:06,196 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 19:36:06,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 19:36:06,196 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 19:36:06,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 19:36:06,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:06,197 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 19:36:06,197 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:06,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:06,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 19:36:06,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:06,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:06,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:06,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:06,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:06,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:06,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:06,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:06,346 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 19:36:06,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:06,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:06,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:06,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 19:36:06,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:06,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 19:36:06,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 19:36:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 19:36:06,669 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 19:36:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:06,706 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 19:36:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 19:36:06,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 19:36:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:06,708 INFO L225 Difference]: With dead ends: 14 [2018-12-03 19:36:06,708 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 19:36:06,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 19:36:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 19:36:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 19:36:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 19:36:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 19:36:06,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 19:36:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:06,712 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 19:36:06,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 19:36:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 19:36:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 19:36:06,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:06,712 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 19:36:06,713 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:06,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:06,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 19:36:06,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:06,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:06,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:06,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:06,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:06,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:06,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 19:36:06,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:06,835 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 19:36:06,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:06,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:06,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 19:36:06,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:06,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:07,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 19:36:07,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:07,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 19:36:07,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 19:36:07,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:36:07,212 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 19:36:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:07,264 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 19:36:07,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 19:36:07,265 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 19:36:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:07,265 INFO L225 Difference]: With dead ends: 15 [2018-12-03 19:36:07,265 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 19:36:07,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:36:07,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 19:36:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 19:36:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 19:36:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 19:36:07,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 19:36:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:07,270 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 19:36:07,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 19:36:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 19:36:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 19:36:07,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:07,271 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 19:36:07,271 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:07,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 19:36:07,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:07,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:07,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:07,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:07,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:07,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:07,444 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 19:36:07,453 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:07,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:07,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:07,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:07,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:07,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 19:36:07,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:07,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 19:36:07,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 19:36:07,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:36:07,711 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 19:36:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:07,760 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 19:36:07,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 19:36:07,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 19:36:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:07,762 INFO L225 Difference]: With dead ends: 16 [2018-12-03 19:36:07,762 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 19:36:07,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:36:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 19:36:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 19:36:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 19:36:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 19:36:07,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 19:36:07,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:07,767 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 19:36:07,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 19:36:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 19:36:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 19:36:07,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:07,768 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 19:36:07,768 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:07,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 19:36:07,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:07,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:07,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:07,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:07,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:07,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:07,905 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 19:36:07,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:07,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:07,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:07,936 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:08,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 19:36:08,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:08,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 19:36:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 19:36:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 19:36:08,224 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 19:36:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:08,254 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 19:36:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 19:36:08,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 19:36:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:08,255 INFO L225 Difference]: With dead ends: 17 [2018-12-03 19:36:08,256 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 19:36:08,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 19:36:08,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 19:36:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 19:36:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 19:36:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 19:36:08,260 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 19:36:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:08,260 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 19:36:08,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 19:36:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 19:36:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 19:36:08,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:08,261 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 19:36:08,261 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:08,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 19:36:08,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:08,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:08,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:08,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:08,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:08,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:08,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:08,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:08,545 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 19:36:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:08,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:08,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 19:36:08,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:08,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:08,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:09,302 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:09,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 19:36:09,323 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:09,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 19:36:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 19:36:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:36:09,324 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 19:36:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:09,366 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 19:36:09,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 19:36:09,366 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 19:36:09,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:09,367 INFO L225 Difference]: With dead ends: 18 [2018-12-03 19:36:09,367 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 19:36:09,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:36:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 19:36:09,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 19:36:09,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 19:36:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 19:36:09,371 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 19:36:09,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:09,371 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 19:36:09,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 19:36:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 19:36:09,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:36:09,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:09,372 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 19:36:09,372 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:09,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:09,373 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 19:36:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:09,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:09,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:09,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:09,538 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:09,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:09,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:09,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 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 19:36:09,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:09,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:09,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:09,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:09,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:09,578 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:09,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 19:36:09,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:09,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 19:36:09,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 19:36:09,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 19:36:09,935 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 19:36:10,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:10,126 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 19:36:10,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 19:36:10,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 19:36:10,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:10,127 INFO L225 Difference]: With dead ends: 19 [2018-12-03 19:36:10,127 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 19:36:10,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 19:36:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 19:36:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 19:36:10,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 19:36:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 19:36:10,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 19:36:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:10,138 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 19:36:10,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 19:36:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 19:36:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:36:10,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:10,139 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 19:36:10,139 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:10,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:10,139 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 19:36:10,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:10,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:10,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:10,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:10,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:10,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:10,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:10,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:10,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:10,407 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 19:36:10,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:10,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:10,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:10,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:10,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 19:36:10,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:10,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 19:36:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 19:36:10,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 19:36:10,911 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 19:36:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:10,941 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 19:36:10,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 19:36:10,941 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 19:36:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:10,942 INFO L225 Difference]: With dead ends: 20 [2018-12-03 19:36:10,942 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 19:36:10,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 19:36:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 19:36:10,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 19:36:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 19:36:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 19:36:10,946 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 19:36:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:10,947 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 19:36:10,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 19:36:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 19:36:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 19:36:10,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:10,947 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 19:36:10,948 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:10,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:10,948 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 19:36:10,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:10,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:10,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:11,130 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:11,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:11,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:11,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:11,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:11,132 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 19:36:11,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:11,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:11,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 19:36:11,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:11,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:11,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:11,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:11,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 19:36:11,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:11,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 19:36:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 19:36:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:36:11,626 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 19:36:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:11,686 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 19:36:11,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:36:11,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 19:36:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:11,687 INFO L225 Difference]: With dead ends: 21 [2018-12-03 19:36:11,687 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 19:36:11,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:36:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 19:36:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 19:36:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 19:36:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 19:36:11,692 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 19:36:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:11,692 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 19:36:11,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 19:36:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 19:36:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:36:11,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:11,693 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 19:36:11,693 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:11,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 19:36:11,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:11,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:11,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:11,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:11,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:12,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:12,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:12,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:12,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:12,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:12,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 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 19:36:12,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:12,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:12,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:12,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:12,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:12,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:12,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:12,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 19:36:12,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:12,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 19:36:12,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 19:36:12,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:36:12,850 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 19:36:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:13,041 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 19:36:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 19:36:13,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 19:36:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:13,042 INFO L225 Difference]: With dead ends: 22 [2018-12-03 19:36:13,043 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 19:36:13,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:36:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 19:36:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 19:36:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 19:36:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 19:36:13,047 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 19:36:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:13,047 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 19:36:13,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 19:36:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 19:36:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:36:13,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:13,048 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 19:36:13,048 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:13,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 19:36:13,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:13,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:13,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:13,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:13,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:13,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:13,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:13,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:13,987 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 19:36:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:14,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:14,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:14,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:14,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:14,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 19:36:14,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:14,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 19:36:14,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 19:36:14,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 19:36:14,831 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 19:36:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:14,862 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 19:36:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 19:36:14,863 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 19:36:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:14,863 INFO L225 Difference]: With dead ends: 23 [2018-12-03 19:36:14,864 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 19:36:14,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 19:36:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 19:36:14,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 19:36:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 19:36:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 19:36:14,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 19:36:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:14,869 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 19:36:14,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 19:36:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 19:36:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 19:36:14,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:14,870 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 19:36:14,870 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:14,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 19:36:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:14,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:14,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:15,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:15,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:15,057 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:15,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 19:36:15,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:15,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 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 19:36:15,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:15,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:15,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 19:36:15,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:15,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:15,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:16,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:16,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 19:36:16,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:16,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 19:36:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 19:36:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:36:16,054 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 19:36:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:16,096 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 19:36:16,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 19:36:16,097 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 19:36:16,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:16,098 INFO L225 Difference]: With dead ends: 24 [2018-12-03 19:36:16,098 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 19:36:16,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:36:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 19:36:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 19:36:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 19:36:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 19:36:16,103 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 19:36:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:16,103 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 19:36:16,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 19:36:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 19:36:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 19:36:16,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:16,104 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 19:36:16,104 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:16,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 19:36:16,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:16,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:16,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:16,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:16,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:16,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:16,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:16,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:16,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:16,896 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 19:36:16,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:16,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:16,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:16,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:16,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:16,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:17,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:17,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 19:36:17,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:17,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 19:36:17,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 19:36:17,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 19:36:17,678 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 19:36:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:17,717 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 19:36:17,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 19:36:17,717 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 19:36:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:17,718 INFO L225 Difference]: With dead ends: 25 [2018-12-03 19:36:17,718 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 19:36:17,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 19:36:17,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 19:36:17,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 19:36:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 19:36:17,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 19:36:17,727 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 19:36:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:17,727 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 19:36:17,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 19:36:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 19:36:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 19:36:17,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:17,728 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 19:36:17,728 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:17,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:17,729 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 19:36:17,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:17,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:17,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:17,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:17,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:18,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:18,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:18,003 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:18,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:18,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:18,004 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 19:36:18,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:18,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:18,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:18,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:18,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 19:36:18,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:18,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 19:36:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 19:36:18,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 19:36:18,719 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 19:36:18,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:18,753 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 19:36:18,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 19:36:18,753 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 19:36:18,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:18,754 INFO L225 Difference]: With dead ends: 26 [2018-12-03 19:36:18,754 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 19:36:18,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 19:36:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 19:36:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 19:36:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 19:36:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 19:36:18,759 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 19:36:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:18,759 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 19:36:18,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 19:36:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 19:36:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 19:36:18,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:18,760 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 19:36:18,761 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:18,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 19:36:18,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:18,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:18,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:18,989 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 19:36:18,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:18,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:18,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:18,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:18,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:18,990 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 19:36:18,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:18,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:19,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 19:36:19,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:19,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:19,028 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 19:36:19,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:19,544 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 19:36:19,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:19,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 19:36:19,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:19,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 19:36:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 19:36:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 19:36:19,566 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 19:36:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:19,660 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 19:36:19,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 19:36:19,660 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 19:36:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:19,660 INFO L225 Difference]: With dead ends: 27 [2018-12-03 19:36:19,660 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 19:36:19,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 19:36:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 19:36:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 19:36:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 19:36:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 19:36:19,665 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 19:36:19,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:19,665 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 19:36:19,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 19:36:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 19:36:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 19:36:19,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:19,666 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 19:36:19,667 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:19,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 19:36:19,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:19,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:19,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:19,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:19,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:20,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:20,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:20,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:20,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:20,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:20,115 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 19:36:20,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:20,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:20,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:20,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:20,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:20,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:20,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:20,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 19:36:20,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:20,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 19:36:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 19:36:20,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:36:20,869 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 19:36:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:20,919 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 19:36:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 19:36:20,921 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 19:36:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:20,922 INFO L225 Difference]: With dead ends: 28 [2018-12-03 19:36:20,922 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 19:36:20,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:36:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 19:36:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 19:36:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 19:36:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 19:36:20,927 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 19:36:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:20,927 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 19:36:20,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 19:36:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 19:36:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 19:36:20,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:20,928 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 19:36:20,928 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:20,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 19:36:20,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:20,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:20,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:20,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:21,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:21,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:21,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:21,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:21,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:21,209 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 19:36:21,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:21,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:21,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:21,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:21,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 19:36:21,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:21,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 19:36:21,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 19:36:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 19:36:21,930 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 19:36:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:22,089 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 19:36:22,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 19:36:22,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 19:36:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:22,090 INFO L225 Difference]: With dead ends: 29 [2018-12-03 19:36:22,090 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 19:36:22,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 19:36:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 19:36:22,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 19:36:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 19:36:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 19:36:22,096 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 19:36:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:22,096 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 19:36:22,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 19:36:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 19:36:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 19:36:22,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:22,097 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 19:36:22,097 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:22,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 19:36:22,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:22,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:22,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:22,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:22,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:22,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:22,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:22,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:22,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:22,557 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 19:36:22,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:22,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:22,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 19:36:22,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:22,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:22,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 19:36:23,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:23,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 19:36:23,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 19:36:23,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:36:23,675 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 19:36:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:23,782 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 19:36:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 19:36:23,783 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 19:36:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:23,783 INFO L225 Difference]: With dead ends: 30 [2018-12-03 19:36:23,783 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 19:36:23,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:36:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 19:36:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 19:36:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 19:36:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 19:36:23,790 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 19:36:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:23,790 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 19:36:23,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 19:36:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 19:36:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 19:36:23,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:23,791 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 19:36:23,791 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:23,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:23,792 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 19:36:23,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:23,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:23,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:23,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:24,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:24,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:24,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:24,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:24,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:24,783 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 19:36:24,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:24,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:24,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:24,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:24,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:24,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:25,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 19:36:25,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:25,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 19:36:25,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 19:36:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:36:25,519 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 19:36:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:25,571 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 19:36:25,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 19:36:25,571 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 19:36:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:25,572 INFO L225 Difference]: With dead ends: 31 [2018-12-03 19:36:25,572 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 19:36:25,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:36:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 19:36:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 19:36:25,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 19:36:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 19:36:25,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 19:36:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:25,578 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 19:36:25,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 19:36:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 19:36:25,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 19:36:25,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:25,579 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 19:36:25,579 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:25,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 19:36:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:25,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:25,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:25,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:25,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:25,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:25,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:25,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 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 19:36:25,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:25,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:25,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:25,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:27,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:27,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 19:36:27,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:27,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 19:36:27,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 19:36:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 19:36:27,472 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 19:36:27,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:27,521 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 19:36:27,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 19:36:27,522 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 19:36:27,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:27,523 INFO L225 Difference]: With dead ends: 32 [2018-12-03 19:36:27,523 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 19:36:27,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 19:36:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 19:36:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 19:36:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 19:36:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 19:36:27,526 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 19:36:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:27,526 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 19:36:27,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 19:36:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 19:36:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 19:36:27,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:27,527 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 19:36:27,527 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:27,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:27,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 19:36:27,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:27,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:27,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:27,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:28,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:28,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:28,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:28,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:28,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:28,088 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 19:36:28,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:28,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:28,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 19:36:28,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:28,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:28,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:29,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:29,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 19:36:29,224 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:29,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 19:36:29,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 19:36:29,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:36:29,226 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 19:36:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:29,406 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 19:36:29,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 19:36:29,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 19:36:29,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:29,408 INFO L225 Difference]: With dead ends: 33 [2018-12-03 19:36:29,408 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 19:36:29,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:36:29,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 19:36:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 19:36:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 19:36:29,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 19:36:29,413 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 19:36:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:29,414 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 19:36:29,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 19:36:29,414 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 19:36:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:36:29,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:29,414 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 19:36:29,415 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:29,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 19:36:29,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:29,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:29,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:29,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:29,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:29,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:29,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:29,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:29,966 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 19:36:29,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:29,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:29,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:29,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:29,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:30,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:30,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:30,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 19:36:30,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:30,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 19:36:30,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 19:36:30,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:36:30,856 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 19:36:30,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:30,901 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 19:36:30,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 19:36:30,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 19:36:30,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:30,902 INFO L225 Difference]: With dead ends: 34 [2018-12-03 19:36:30,902 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 19:36:30,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:36:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 19:36:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 19:36:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 19:36:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 19:36:30,908 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 19:36:30,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:30,908 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 19:36:30,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 19:36:30,909 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 19:36:30,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 19:36:30,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:30,909 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 19:36:30,909 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:30,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:30,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 19:36:30,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:30,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:30,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:30,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:31,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:31,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:31,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:31,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:31,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:31,315 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 19:36:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:31,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:31,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:31,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:32,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:32,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 19:36:32,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:32,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 19:36:32,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 19:36:32,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 19:36:32,335 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 19:36:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:32,408 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 19:36:32,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 19:36:32,408 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 19:36:32,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:32,409 INFO L225 Difference]: With dead ends: 35 [2018-12-03 19:36:32,409 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 19:36:32,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 19:36:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 19:36:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 19:36:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 19:36:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 19:36:32,413 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 19:36:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:32,414 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 19:36:32,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 19:36:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 19:36:32,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 19:36:32,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:32,414 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 19:36:32,415 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:32,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:32,415 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 19:36:32,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:32,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:32,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:32,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:32,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:33,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:33,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:33,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:33,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:33,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:33,178 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 19:36:33,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:33,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:33,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 19:36:33,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:33,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:33,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:34,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:34,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 19:36:34,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:34,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 19:36:34,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 19:36:34,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:36:34,641 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 19:36:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:34,680 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 19:36:34,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 19:36:34,680 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 19:36:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:34,681 INFO L225 Difference]: With dead ends: 36 [2018-12-03 19:36:34,681 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 19:36:34,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:36:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 19:36:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 19:36:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 19:36:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 19:36:34,686 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 19:36:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:34,686 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 19:36:34,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 19:36:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 19:36:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 19:36:34,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:34,687 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 19:36:34,687 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:34,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:34,687 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 19:36:34,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:34,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:34,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:34,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:35,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:35,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:35,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:35,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 19:36:35,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:35,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 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 19:36:35,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:35,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:35,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:35,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:35,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:35,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:36,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:36,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 19:36:36,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:36,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 19:36:36,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 19:36:36,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 19:36:36,263 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 19:36:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:36,307 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 19:36:36,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 19:36:36,307 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 19:36:36,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:36,308 INFO L225 Difference]: With dead ends: 37 [2018-12-03 19:36:36,308 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 19:36:36,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 19:36:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 19:36:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 19:36:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 19:36:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 19:36:36,312 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 19:36:36,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:36,312 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 19:36:36,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 19:36:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 19:36:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:36:36,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:36,313 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 19:36:36,313 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:36,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 19:36:36,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:36,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:36,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:36,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:36,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:36,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:36,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:36,777 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:36,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 19:36:36,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:36,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 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 19:36:36,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:36,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:36,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:36,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:38,165 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:38,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:38,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 19:36:38,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:38,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 19:36:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 19:36:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 19:36:38,186 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 19:36:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:38,237 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 19:36:38,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 19:36:38,237 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 19:36:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:38,238 INFO L225 Difference]: With dead ends: 38 [2018-12-03 19:36:38,238 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 19:36:38,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 19:36:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 19:36:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 19:36:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 19:36:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 19:36:38,243 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 19:36:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:38,243 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 19:36:38,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 19:36:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 19:36:38,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 19:36:38,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:38,244 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 19:36:38,244 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:38,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:38,244 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 19:36:38,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:38,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:38,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:38,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:38,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:38,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:38,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:38,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:38,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:38,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:38,757 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 19:36:38,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:38,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:38,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 19:36:38,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:38,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:38,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:39,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 19:36:39,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:39,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 19:36:39,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 19:36:39,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 19:36:39,953 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 19:36:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:40,033 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 19:36:40,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 19:36:40,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 19:36:40,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:40,034 INFO L225 Difference]: With dead ends: 39 [2018-12-03 19:36:40,034 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 19:36:40,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 19:36:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 19:36:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 19:36:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 19:36:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 19:36:40,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 19:36:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:40,040 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 19:36:40,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 19:36:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 19:36:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:36:40,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:40,041 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 19:36:40,041 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:40,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 19:36:40,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:40,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:40,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:40,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:40,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:40,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:40,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:40,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:40,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:40,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:40,588 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 19:36:40,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:40,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:40,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:40,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:40,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:40,627 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:40,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:41,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:41,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 19:36:41,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:41,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 19:36:41,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 19:36:41,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 19:36:41,871 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 19:36:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:41,955 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 19:36:41,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 19:36:41,956 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 19:36:41,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:41,956 INFO L225 Difference]: With dead ends: 40 [2018-12-03 19:36:41,957 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 19:36:41,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 19:36:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 19:36:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 19:36:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 19:36:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 19:36:41,960 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 19:36:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:41,961 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 19:36:41,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 19:36:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 19:36:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 19:36:41,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:41,961 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 19:36:41,962 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:41,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 19:36:41,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:41,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:41,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:41,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:41,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:42,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:42,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:42,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:42,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 19:36:42,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:42,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 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 19:36:42,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:42,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:42,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:42,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:44,329 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:44,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:44,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 19:36:44,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:44,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 19:36:44,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 19:36:44,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 19:36:44,352 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 19:36:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:44,422 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 19:36:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 19:36:44,423 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 19:36:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:44,423 INFO L225 Difference]: With dead ends: 41 [2018-12-03 19:36:44,424 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 19:36:44,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 19:36:44,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 19:36:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 19:36:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 19:36:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 19:36:44,428 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 19:36:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:44,428 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 19:36:44,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 19:36:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 19:36:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 19:36:44,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:44,429 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 19:36:44,429 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:44,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 19:36:44,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:44,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:44,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:44,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:44,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:44,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:44,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:44,966 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 19:36:44,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:44,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:45,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 19:36:45,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:45,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:45,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:46,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:46,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 19:36:46,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:46,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 19:36:46,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 19:36:46,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 19:36:46,453 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 19:36:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:46,509 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 19:36:46,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 19:36:46,509 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 19:36:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:46,510 INFO L225 Difference]: With dead ends: 42 [2018-12-03 19:36:46,510 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 19:36:46,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 19:36:46,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 19:36:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 19:36:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 19:36:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 19:36:46,514 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 19:36:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:46,514 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 19:36:46,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 19:36:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 19:36:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 19:36:46,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:46,515 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 19:36:46,515 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:46,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 19:36:46,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:46,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:46,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:46,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:46,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:47,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:47,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:47,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:47,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:47,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:47,111 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 19:36:47,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:47,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:47,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:47,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:47,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:47,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:48,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:48,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 19:36:48,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:48,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 19:36:48,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 19:36:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 19:36:48,962 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 19:36:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:49,016 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 19:36:49,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 19:36:49,017 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 19:36:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:49,018 INFO L225 Difference]: With dead ends: 43 [2018-12-03 19:36:49,018 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 19:36:49,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 19:36:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 19:36:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 19:36:49,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 19:36:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 19:36:49,021 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 19:36:49,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:49,021 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 19:36:49,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 19:36:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 19:36:49,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 19:36:49,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:49,022 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 19:36:49,023 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:49,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:49,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 19:36:49,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:49,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:49,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:49,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:49,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:49,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:49,597 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:49,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:49,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:49,597 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 19:36:49,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:49,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:49,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:49,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:51,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:51,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 19:36:51,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:51,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 19:36:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 19:36:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 19:36:51,309 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 19:36:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:51,372 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 19:36:51,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 19:36:51,373 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 19:36:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:51,374 INFO L225 Difference]: With dead ends: 44 [2018-12-03 19:36:51,374 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 19:36:51,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 19:36:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 19:36:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 19:36:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 19:36:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 19:36:51,377 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 19:36:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:51,377 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 19:36:51,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 19:36:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 19:36:51,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 19:36:51,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:51,378 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 19:36:51,379 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:51,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:51,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 19:36:51,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:51,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:51,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:51,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:51,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:52,199 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:52,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:52,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:52,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:52,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:52,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:52,200 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 19:36:52,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:52,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:52,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 19:36:52,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:52,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:52,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:54,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:54,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 19:36:54,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:54,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 19:36:54,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 19:36:54,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 19:36:54,268 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 19:36:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:54,347 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 19:36:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 19:36:54,348 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 19:36:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:54,349 INFO L225 Difference]: With dead ends: 45 [2018-12-03 19:36:54,349 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 19:36:54,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 19:36:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 19:36:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 19:36:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 19:36:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 19:36:54,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 19:36:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:54,352 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 19:36:54,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 19:36:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 19:36:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 19:36:54,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:54,353 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 19:36:54,353 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:54,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 19:36:54,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:54,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:54,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:55,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:55,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:55,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:55,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:55,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:55,031 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 19:36:55,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:55,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:55,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:55,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:55,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:55,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:56,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:56,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 19:36:56,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:56,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 19:36:56,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 19:36:56,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:36:56,720 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 19:36:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:56,767 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 19:36:56,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 19:36:56,768 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 19:36:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:56,768 INFO L225 Difference]: With dead ends: 46 [2018-12-03 19:36:56,769 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 19:36:56,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:36:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 19:36:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 19:36:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 19:36:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 19:36:56,772 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 19:36:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:56,772 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 19:36:56,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 19:36:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 19:36:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:36:56,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:56,773 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 19:36:56,773 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:56,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 19:36:56,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:56,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:56,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:57,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:57,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:57,569 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:57,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:57,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:57,569 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 19:36:57,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:57,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:57,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:57,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:59,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:59,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 19:36:59,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:59,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 19:36:59,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 19:36:59,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 19:36:59,799 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 19:36:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:59,887 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 19:36:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 19:36:59,888 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 19:36:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:59,889 INFO L225 Difference]: With dead ends: 47 [2018-12-03 19:36:59,889 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 19:36:59,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 19:36:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 19:36:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 19:36:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 19:36:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 19:36:59,892 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 19:36:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:59,892 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 19:36:59,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 19:36:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 19:36:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 19:36:59,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:59,893 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 19:36:59,893 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:59,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:59,893 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 19:36:59,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:59,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:59,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:59,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:59,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:00,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:00,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:00,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:00,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 19:37:00,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:00,802 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 19:37:00,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:00,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:00,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 19:37:00,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:00,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:00,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:02,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:02,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 19:37:02,726 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:02,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 19:37:02,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 19:37:02,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 19:37:02,727 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 19:37:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:02,793 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 19:37:02,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 19:37:02,794 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 19:37:02,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:02,795 INFO L225 Difference]: With dead ends: 48 [2018-12-03 19:37:02,795 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 19:37:02,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 19:37:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 19:37:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 19:37:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 19:37:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 19:37:02,797 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 19:37:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:02,797 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 19:37:02,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 19:37:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 19:37:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 19:37:02,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:02,798 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 19:37:02,798 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:02,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:02,798 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 19:37:02,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:02,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:02,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:03,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:03,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:03,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:03,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:03,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:03,973 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 19:37:03,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:03,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:04,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:04,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:04,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:04,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:06,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:06,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 19:37:06,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:06,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 19:37:06,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 19:37:06,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 19:37:06,210 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 19:37:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:06,259 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 19:37:06,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 19:37:06,259 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 19:37:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:06,260 INFO L225 Difference]: With dead ends: 49 [2018-12-03 19:37:06,260 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 19:37:06,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 19:37:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 19:37:06,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 19:37:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 19:37:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 19:37:06,264 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 19:37:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:06,264 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 19:37:06,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 19:37:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 19:37:06,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 19:37:06,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:06,265 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 19:37:06,265 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:06,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 19:37:06,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:06,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:06,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:07,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:07,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:07,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:07,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 19:37:07,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:07,080 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 19:37:07,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:07,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:07,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:07,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:09,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:09,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 19:37:09,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:09,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 19:37:09,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 19:37:09,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 19:37:09,344 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 19:37:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:09,485 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 19:37:09,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 19:37:09,486 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 19:37:09,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:09,487 INFO L225 Difference]: With dead ends: 50 [2018-12-03 19:37:09,487 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 19:37:09,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 19:37:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 19:37:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 19:37:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 19:37:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 19:37:09,491 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 19:37:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:09,491 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 19:37:09,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 19:37:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 19:37:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 19:37:09,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:09,492 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 19:37:09,492 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:09,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:09,493 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 19:37:09,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:09,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:09,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:09,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:09,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:10,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:10,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:10,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:10,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:10,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:10,300 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 19:37:10,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:10,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:10,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 19:37:10,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:10,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:10,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:12,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:12,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 19:37:12,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:12,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 19:37:12,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 19:37:12,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 19:37:12,510 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 19:37:12,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:12,562 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 19:37:12,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 19:37:12,562 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 19:37:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:12,563 INFO L225 Difference]: With dead ends: 51 [2018-12-03 19:37:12,563 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 19:37:12,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 19:37:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 19:37:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 19:37:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 19:37:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 19:37:12,567 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 19:37:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:12,567 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 19:37:12,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 19:37:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 19:37:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 19:37:12,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:12,568 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 19:37:12,568 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:12,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 19:37:12,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:12,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:12,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:12,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:12,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:13,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:13,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:13,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:13,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:13,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:13,406 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 19:37:13,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:13,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:13,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:13,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:13,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:13,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:15,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:15,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 19:37:15,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:15,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 19:37:15,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 19:37:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 19:37:15,907 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 19:37:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:16,229 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 19:37:16,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 19:37:16,230 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 19:37:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:16,231 INFO L225 Difference]: With dead ends: 52 [2018-12-03 19:37:16,231 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 19:37:16,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 19:37:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 19:37:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 19:37:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 19:37:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 19:37:16,235 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 19:37:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:16,236 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 19:37:16,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 19:37:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 19:37:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 19:37:16,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:16,236 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 19:37:16,237 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:16,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 19:37:16,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:16,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:16,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:16,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:16,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:17,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:17,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:17,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:17,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:17,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:17,307 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 19:37:17,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:17,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:17,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:17,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:19,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 19:37:19,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:19,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 19:37:19,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 19:37:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 19:37:19,866 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 19:37:19,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:19,951 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 19:37:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 19:37:19,951 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 19:37:19,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:19,952 INFO L225 Difference]: With dead ends: 53 [2018-12-03 19:37:19,952 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 19:37:19,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 19:37:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 19:37:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 19:37:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 19:37:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 19:37:19,956 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 19:37:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 19:37:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 19:37:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 19:37:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:37:19,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:19,957 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 19:37:19,957 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:19,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 19:37:19,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:19,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:19,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:19,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:21,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:21,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:21,140 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:21,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 19:37:21,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:21,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 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 19:37:21,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:21,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:21,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 19:37:21,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:21,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:21,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:23,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:23,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 19:37:23,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:23,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 19:37:23,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 19:37:23,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 19:37:23,656 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 19:37:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:23,730 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 19:37:23,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 19:37:23,736 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 19:37:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:23,737 INFO L225 Difference]: With dead ends: 54 [2018-12-03 19:37:23,737 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 19:37:23,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 19:37:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 19:37:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 19:37:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 19:37:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 19:37:23,740 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 19:37:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:23,740 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 19:37:23,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 19:37:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 19:37:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 19:37:23,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:23,741 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 19:37:23,741 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:23,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:23,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 19:37:23,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:23,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:23,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:23,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:23,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:24,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:24,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:24,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:24,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:24,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:24,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:24,939 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 19:37:24,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:24,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:24,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:24,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:24,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:24,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:27,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:27,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 19:37:27,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:27,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 19:37:27,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 19:37:27,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 19:37:27,444 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 19:37:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:27,574 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 19:37:27,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 19:37:27,575 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 19:37:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:27,575 INFO L225 Difference]: With dead ends: 55 [2018-12-03 19:37:27,576 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 19:37:27,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 19:37:27,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 19:37:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 19:37:27,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 19:37:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 19:37:27,580 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 19:37:27,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:27,580 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 19:37:27,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 19:37:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 19:37:27,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 19:37:27,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:27,581 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 19:37:27,581 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:27,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:27,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 19:37:27,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:27,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:27,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:27,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:30,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:30,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:30,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:30,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:30,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:30,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:30,013 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 19:37:30,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:30,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:30,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:30,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 19:37:32,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:32,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 19:37:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 19:37:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 19:37:32,884 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 19:37:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:32,978 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 19:37:32,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 19:37:32,979 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 19:37:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:32,980 INFO L225 Difference]: With dead ends: 56 [2018-12-03 19:37:32,980 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 19:37:32,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 19:37:32,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 19:37:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 19:37:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 19:37:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 19:37:32,984 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 19:37:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:32,984 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 19:37:32,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 19:37:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 19:37:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 19:37:32,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:32,985 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 19:37:32,985 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:32,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:32,985 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 19:37:32,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:32,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:32,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:32,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:32,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:34,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:34,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:34,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:34,017 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:34,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:34,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:34,017 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 19:37:34,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:34,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:34,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 19:37:34,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:34,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:34,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:37,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:37,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 19:37:37,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:37,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 19:37:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 19:37:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 19:37:37,118 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 19:37:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:37,265 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 19:37:37,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 19:37:37,266 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 19:37:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:37,267 INFO L225 Difference]: With dead ends: 57 [2018-12-03 19:37:37,267 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 19:37:37,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 19:37:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 19:37:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 19:37:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 19:37:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 19:37:37,270 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 19:37:37,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:37,271 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 19:37:37,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 19:37:37,271 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 19:37:37,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 19:37:37,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:37,271 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 19:37:37,271 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:37,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:37,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-12-03 19:37:37,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:37,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:37,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:37,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:37,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:38,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:38,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:38,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:38,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:38,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:38,297 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 19:37:38,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:38,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:38,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:38,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:38,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:38,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:41,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:41,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 19:37:41,458 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:41,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 19:37:41,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 19:37:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 19:37:41,460 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 19:37:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:41,541 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 19:37:41,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 19:37:41,542 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 19:37:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:41,542 INFO L225 Difference]: With dead ends: 58 [2018-12-03 19:37:41,543 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 19:37:41,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 19:37:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 19:37:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 19:37:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 19:37:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 19:37:41,547 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 19:37:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:41,547 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 19:37:41,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 19:37:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 19:37:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 19:37:41,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:41,548 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 19:37:41,548 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:41,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-12-03 19:37:41,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:41,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:41,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:41,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:42,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:42,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:42,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:42,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 19:37:42,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:42,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 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 19:37:42,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:42,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:42,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:42,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:45,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:45,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 19:37:45,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:45,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 19:37:45,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 19:37:45,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 19:37:45,979 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 19:37:46,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:46,059 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 19:37:46,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 19:37:46,059 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 19:37:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:46,060 INFO L225 Difference]: With dead ends: 59 [2018-12-03 19:37:46,060 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 19:37:46,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 19:37:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 19:37:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 19:37:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 19:37:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 19:37:46,064 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 19:37:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:46,064 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 19:37:46,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 19:37:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 19:37:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 19:37:46,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:46,065 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 19:37:46,065 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:46,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-12-03 19:37:46,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:46,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:46,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:46,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:46,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:47,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:47,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:47,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:47,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 19:37:47,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:47,168 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 19:37:47,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:47,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:47,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 19:37:47,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:47,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:47,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:50,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:50,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 19:37:50,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:50,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 19:37:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 19:37:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 19:37:50,571 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 19:37:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:50,657 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 19:37:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 19:37:50,658 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 19:37:50,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:50,659 INFO L225 Difference]: With dead ends: 60 [2018-12-03 19:37:50,659 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 19:37:50,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 19:37:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 19:37:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 19:37:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 19:37:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 19:37:50,663 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 19:37:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:50,663 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 19:37:50,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 19:37:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 19:37:50,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 19:37:50,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:50,664 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 19:37:50,664 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:50,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:50,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-12-03 19:37:50,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:50,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:50,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:51,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:51,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:51,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:51,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:51,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:51,841 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 19:37:51,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:51,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:51,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:51,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:51,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:51,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:55,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:55,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 19:37:55,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:55,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 19:37:55,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 19:37:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 19:37:55,423 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 19:37:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:55,488 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 19:37:55,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 19:37:55,488 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 19:37:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:55,489 INFO L225 Difference]: With dead ends: 61 [2018-12-03 19:37:55,489 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 19:37:55,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 19:37:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 19:37:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 19:37:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 19:37:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 19:37:55,492 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 19:37:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:55,492 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 19:37:55,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 19:37:55,492 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 19:37:55,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 19:37:55,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:55,493 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 19:37:55,493 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:55,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-12-03 19:37:55,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:55,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:55,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:55,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:56,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:56,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:56,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:56,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:56,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:56,614 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 19:37:56,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:56,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:56,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:56,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:59,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:59,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:59,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 19:37:59,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:59,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 19:37:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 19:37:59,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 19:37:59,990 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 19:38:00,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:00,104 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 19:38:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 19:38:00,104 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 19:38:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:00,105 INFO L225 Difference]: With dead ends: 62 [2018-12-03 19:38:00,105 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 19:38:00,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 19:38:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 19:38:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 19:38:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 19:38:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 19:38:00,109 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 19:38:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:00,110 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 19:38:00,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 19:38:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 19:38:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 19:38:00,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:00,110 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 19:38:00,110 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:00,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-12-03 19:38:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:00,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:00,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:01,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:01,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:01,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:01,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:01,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:01,325 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 19:38:01,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:01,334 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:01,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 19:38:01,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:01,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:01,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:01,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:04,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:04,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 19:38:04,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:04,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 19:38:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 19:38:04,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 19:38:04,805 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 19:38:04,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:04,971 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 19:38:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 19:38:04,971 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 19:38:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:04,972 INFO L225 Difference]: With dead ends: 63 [2018-12-03 19:38:04,972 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 19:38:04,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 19:38:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 19:38:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 19:38:04,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 19:38:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 19:38:04,976 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 19:38:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:04,976 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 19:38:04,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 19:38:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 19:38:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 19:38:04,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:04,977 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 19:38:04,977 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:04,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-12-03 19:38:04,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:04,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:04,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:04,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:06,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:06,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:06,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:06,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:06,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:06,542 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 19:38:06,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:06,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:06,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:06,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:06,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:06,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:06,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:10,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:10,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:10,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 19:38:10,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:10,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 19:38:10,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 19:38:10,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 19:38:10,354 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 19:38:10,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:10,437 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 19:38:10,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 19:38:10,437 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 19:38:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:10,438 INFO L225 Difference]: With dead ends: 64 [2018-12-03 19:38:10,438 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 19:38:10,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 19:38:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 19:38:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 19:38:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 19:38:10,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 19:38:10,442 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 19:38:10,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:10,443 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 19:38:10,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 19:38:10,443 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 19:38:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 19:38:10,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:10,443 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 19:38:10,444 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:10,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:10,444 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-12-03 19:38:10,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:10,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:10,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:10,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:10,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:10,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:11,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:11,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:11,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:11,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:11,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:11,930 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 19:38:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:11,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:11,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:11,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:16,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:16,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 19:38:16,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:16,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 19:38:16,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 19:38:16,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 19:38:16,030 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 19:38:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:16,124 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 19:38:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 19:38:16,124 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 19:38:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:16,125 INFO L225 Difference]: With dead ends: 65 [2018-12-03 19:38:16,125 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 19:38:16,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 19:38:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 19:38:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 19:38:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 19:38:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 19:38:16,129 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 19:38:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:16,129 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 19:38:16,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 19:38:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 19:38:16,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 19:38:16,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:16,130 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 19:38:16,130 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:16,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-12-03 19:38:16,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:16,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:16,131 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:19,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:19,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:19,382 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:19,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:19,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:19,382 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 19:38:19,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:19,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:19,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 19:38:19,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:19,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:19,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:23,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:23,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 19:38:23,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:23,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 19:38:23,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 19:38:23,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 19:38:23,579 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 19:38:23,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:23,670 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 19:38:23,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 19:38:23,671 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 19:38:23,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:23,671 INFO L225 Difference]: With dead ends: 66 [2018-12-03 19:38:23,672 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 19:38:23,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 19:38:23,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 19:38:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 19:38:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 19:38:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 19:38:23,675 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 19:38:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:23,675 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 19:38:23,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 19:38:23,675 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 19:38:23,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 19:38:23,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:23,676 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 19:38:23,676 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:23,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:23,676 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-12-03 19:38:23,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:23,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:23,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:23,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:26,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:26,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:26,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:26,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 19:38:26,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:26,094 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 19:38:26,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:26,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:26,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:26,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:26,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:26,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:30,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 19:38:30,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:30,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 19:38:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 19:38:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 19:38:30,036 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 19:38:30,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:30,133 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 19:38:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 19:38:30,134 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 19:38:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:30,134 INFO L225 Difference]: With dead ends: 67 [2018-12-03 19:38:30,135 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 19:38:30,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 19:38:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 19:38:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 19:38:30,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 19:38:30,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 19:38:30,139 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 19:38:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:30,139 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 19:38:30,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 19:38:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 19:38:30,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 19:38:30,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:30,139 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 19:38:30,140 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:30,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:30,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-12-03 19:38:30,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:30,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:30,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:30,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:30,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:31,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:31,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:31,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:31,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:31,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:31,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:31,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 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 19:38:31,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:31,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:31,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:31,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:36,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:36,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 19:38:36,136 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:36,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 19:38:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 19:38:36,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 19:38:36,138 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 19:38:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:36,261 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 19:38:36,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 19:38:36,261 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 19:38:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:36,262 INFO L225 Difference]: With dead ends: 68 [2018-12-03 19:38:36,262 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 19:38:36,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 19:38:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 19:38:36,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 19:38:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 19:38:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 19:38:36,266 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 19:38:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:36,266 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 19:38:36,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 19:38:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 19:38:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 19:38:36,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:36,266 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 19:38:36,267 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:36,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-12-03 19:38:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:36,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:36,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:37,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:37,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:37,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:37,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:37,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:37,679 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 19:38:37,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:37,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:37,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 19:38:37,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:37,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:37,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:42,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:42,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 19:38:42,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:42,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 19:38:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 19:38:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 19:38:42,019 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 19:38:42,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:42,175 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 19:38:42,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 19:38:42,175 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 19:38:42,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:42,176 INFO L225 Difference]: With dead ends: 69 [2018-12-03 19:38:42,176 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 19:38:42,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 19:38:42,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 19:38:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 19:38:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 19:38:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 19:38:42,181 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 19:38:42,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:42,181 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 19:38:42,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 19:38:42,181 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 19:38:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 19:38:42,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:42,182 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 19:38:42,182 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:42,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:42,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-12-03 19:38:42,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:42,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:42,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:42,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:42,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:43,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:43,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:43,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:43,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:43,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:43,632 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 19:38:43,644 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:43,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:43,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:43,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:43,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:43,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:48,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:48,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 19:38:48,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:48,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 19:38:48,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 19:38:48,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 19:38:48,253 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 19:38:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:48,354 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 19:38:48,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 19:38:48,354 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 19:38:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:48,355 INFO L225 Difference]: With dead ends: 70 [2018-12-03 19:38:48,355 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 19:38:48,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 19:38:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 19:38:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 19:38:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 19:38:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 19:38:48,360 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 19:38:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:48,360 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 19:38:48,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 19:38:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 19:38:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 19:38:48,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:48,361 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 19:38:48,361 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:48,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-12-03 19:38:48,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:48,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:48,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:49,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:49,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:49,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:49,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:49,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:49,903 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 19:38:49,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:49,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:49,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:49,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:54,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:54,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 19:38:54,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:54,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 19:38:54,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 19:38:54,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 19:38:54,548 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 19:38:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:54,826 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 19:38:54,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 19:38:54,826 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 19:38:54,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:54,827 INFO L225 Difference]: With dead ends: 71 [2018-12-03 19:38:54,827 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 19:38:54,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 19:38:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 19:38:54,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 19:38:54,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 19:38:54,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 19:38:54,831 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 19:38:54,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:54,831 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 19:38:54,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 19:38:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 19:38:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 19:38:54,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:54,832 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 19:38:54,832 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:54,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-12-03 19:38:54,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:54,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:54,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:54,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:54,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:56,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:56,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:56,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:56,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 19:38:56,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:56,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 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 19:38:56,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:56,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:56,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 19:38:56,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:56,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:56,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:01,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:01,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 19:39:01,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:01,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 19:39:01,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 19:39:01,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 19:39:01,334 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 19:39:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:01,478 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 19:39:01,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 19:39:01,479 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 19:39:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:01,480 INFO L225 Difference]: With dead ends: 72 [2018-12-03 19:39:01,480 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 19:39:01,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 19:39:01,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 19:39:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 19:39:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 19:39:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 19:39:01,483 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 19:39:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:01,484 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 19:39:01,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 19:39:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 19:39:01,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 19:39:01,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:01,485 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 19:39:01,485 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:01,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:01,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-12-03 19:39:01,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:01,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:01,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:01,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:03,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:03,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:03,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:03,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:03,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:03,687 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 19:39:03,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:39:03,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:39:03,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:39:03,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:03,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:03,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:09,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:09,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 19:39:09,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:09,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 19:39:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 19:39:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 19:39:09,502 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 19:39:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:09,593 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 19:39:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 19:39:09,593 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 19:39:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:09,594 INFO L225 Difference]: With dead ends: 73 [2018-12-03 19:39:09,594 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 19:39:09,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 19:39:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 19:39:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 19:39:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 19:39:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 19:39:09,597 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 19:39:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:09,598 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 19:39:09,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 19:39:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 19:39:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 19:39:09,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:09,598 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 19:39:09,598 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:09,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-12-03 19:39:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:09,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:09,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:11,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:11,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:11,233 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:11,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:11,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:11,233 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 19:39:11,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:11,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:39:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:11,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:11,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:16,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:16,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 19:39:16,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:16,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 19:39:16,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 19:39:16,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 19:39:16,209 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 19:39:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:16,328 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 19:39:16,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 19:39:16,328 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 19:39:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:16,329 INFO L225 Difference]: With dead ends: 74 [2018-12-03 19:39:16,329 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 19:39:16,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 19:39:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 19:39:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 19:39:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 19:39:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 19:39:16,333 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 19:39:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:16,333 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 19:39:16,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 19:39:16,333 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 19:39:16,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 19:39:16,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:16,334 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 19:39:16,334 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:16,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-12-03 19:39:16,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:16,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:16,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:16,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:16,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:18,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:18,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:18,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:18,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:18,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:18,124 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 19:39:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:39:18,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:39:18,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 19:39:18,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:18,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:18,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:23,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 19:39:23,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:23,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 19:39:23,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 19:39:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 19:39:23,242 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 19:39:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:23,327 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 19:39:23,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 19:39:23,328 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 19:39:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:23,329 INFO L225 Difference]: With dead ends: 75 [2018-12-03 19:39:23,329 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 19:39:23,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 19:39:23,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 19:39:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 19:39:23,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 19:39:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 19:39:23,332 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 19:39:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:23,332 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 19:39:23,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 19:39:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 19:39:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 19:39:23,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:23,333 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 19:39:23,333 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:23,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-12-03 19:39:23,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:23,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:23,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:23,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:23,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:25,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:25,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:25,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:25,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:25,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:25,059 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 19:39:25,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:39:25,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:39:25,104 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:39:25,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:25,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:25,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:30,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:30,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 19:39:30,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:30,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 19:39:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 19:39:30,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 19:39:30,205 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 19:39:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:30,335 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 19:39:30,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 19:39:30,335 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 19:39:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:30,336 INFO L225 Difference]: With dead ends: 76 [2018-12-03 19:39:30,336 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 19:39:30,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 19:39:30,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 19:39:30,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 19:39:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 19:39:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 19:39:30,341 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 19:39:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:30,341 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 19:39:30,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 19:39:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 19:39:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 19:39:30,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:30,342 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 19:39:30,342 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:30,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:30,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-12-03 19:39:30,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:30,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:30,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:30,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:30,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:32,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:32,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:32,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:32,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:32,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:32,625 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 19:39:32,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:32,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:39:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:32,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:32,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:37,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:37,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:37,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 19:39:37,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:37,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 19:39:37,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 19:39:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 19:39:37,822 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 19:39:38,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:38,045 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 19:39:38,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 19:39:38,046 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 19:39:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:38,047 INFO L225 Difference]: With dead ends: 77 [2018-12-03 19:39:38,047 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 19:39:38,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 19:39:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 19:39:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 19:39:38,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 19:39:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 19:39:38,051 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 19:39:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:38,051 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 19:39:38,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 19:39:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 19:39:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 19:39:38,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:38,052 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 19:39:38,052 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:38,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-12-03 19:39:38,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:38,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:38,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:39,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:39,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:39,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:39,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:39,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:39,875 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 19:39:39,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:39:39,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:39:39,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 19:39:39,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:39,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:39,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:45,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:45,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:45,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 19:39:45,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:45,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 19:39:45,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 19:39:45,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 19:39:45,291 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 19:39:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:45,388 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 19:39:45,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 19:39:45,389 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 19:39:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:45,390 INFO L225 Difference]: With dead ends: 78 [2018-12-03 19:39:45,390 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 19:39:45,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 19:39:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 19:39:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 19:39:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 19:39:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 19:39:45,395 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 19:39:45,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:45,395 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 19:39:45,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 19:39:45,395 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 19:39:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 19:39:45,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:45,396 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 19:39:45,396 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:45,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-12-03 19:39:45,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:45,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:45,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:45,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:47,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:47,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:47,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:47,407 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 19:39:47,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:39:47,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:39:47,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:39:47,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:39:47,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:47,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:47,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:39:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:52,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:39:52,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 19:39:52,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:39:52,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 19:39:52,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 19:39:52,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 19:39:52,960 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 19:39:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:39:53,059 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 19:39:53,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 19:39:53,060 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 19:39:53,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:39:53,061 INFO L225 Difference]: With dead ends: 79 [2018-12-03 19:39:53,061 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 19:39:53,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 19:39:53,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 19:39:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 19:39:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 19:39:53,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 19:39:53,065 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 19:39:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:39:53,065 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 19:39:53,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 19:39:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 19:39:53,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 19:39:53,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:39:53,066 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 19:39:53,066 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:39:53,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:39:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-12-03 19:39:53,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:39:53,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:53,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:39:53,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:39:53,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:39:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:55,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:39:55,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:39:55,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:39:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:39:55,023 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 19:39:55,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:39:55,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:39:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:39:55,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:39:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:39:55,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:00,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:00,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 19:40:00,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:00,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 19:40:00,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 19:40:00,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 19:40:00,657 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 19:40:00,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:00,753 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 19:40:00,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 19:40:00,753 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 19:40:00,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:00,754 INFO L225 Difference]: With dead ends: 80 [2018-12-03 19:40:00,754 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 19:40:00,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 19:40:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 19:40:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 19:40:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 19:40:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 19:40:00,758 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 19:40:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:00,758 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 19:40:00,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 19:40:00,758 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 19:40:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 19:40:00,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:00,759 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 19:40:00,759 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:00,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-12-03 19:40:00,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:00,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:00,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:00,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:02,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:02,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:02,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:02,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 19:40:02,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:02,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 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 19:40:02,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:40:02,733 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:40:02,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 19:40:02,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:02,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:02,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 19:40:08,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:08,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 19:40:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 19:40:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 19:40:08,555 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 19:40:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:08,659 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 19:40:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 19:40:08,660 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 19:40:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:08,661 INFO L225 Difference]: With dead ends: 81 [2018-12-03 19:40:08,661 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 19:40:08,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 19:40:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 19:40:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 19:40:08,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 19:40:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 19:40:08,665 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 19:40:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:08,666 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 19:40:08,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 19:40:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 19:40:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 19:40:08,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:08,667 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 19:40:08,667 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:08,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-12-03 19:40:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:08,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:08,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:08,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:10,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:10,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:10,682 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:10,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:10,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:10,683 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 19:40:10,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:40:10,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:40:10,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:40:10,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:10,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:10,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 19:40:16,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:16,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 19:40:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 19:40:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 19:40:16,566 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 19:40:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:16,692 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 19:40:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 19:40:16,692 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 19:40:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:16,693 INFO L225 Difference]: With dead ends: 82 [2018-12-03 19:40:16,693 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 19:40:16,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 19:40:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 19:40:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 19:40:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 19:40:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 19:40:16,697 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 19:40:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:16,698 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 19:40:16,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 19:40:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 19:40:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 19:40:16,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:16,698 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 19:40:16,699 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:16,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-12-03 19:40:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:16,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:16,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:16,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:16,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:18,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:18,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:18,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:18,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 19:40:18,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:18,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 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 19:40:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:18,723 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:40:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:18,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:18,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:24,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:24,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 19:40:24,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:24,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 19:40:24,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 19:40:24,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 19:40:24,764 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 19:40:25,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:25,417 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 19:40:25,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 19:40:25,417 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 19:40:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:25,418 INFO L225 Difference]: With dead ends: 83 [2018-12-03 19:40:25,418 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 19:40:25,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 19:40:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 19:40:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 19:40:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 19:40:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 19:40:25,421 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 19:40:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:25,421 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 19:40:25,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 19:40:25,421 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 19:40:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 19:40:25,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:25,422 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 19:40:25,422 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:25,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-12-03 19:40:25,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:25,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:25,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:25,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:25,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:27,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:27,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:27,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:27,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 19:40:27,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:27,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 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 19:40:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:40:27,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:40:27,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 19:40:27,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:27,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:27,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:27,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:33,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:33,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:33,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 19:40:33,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:33,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 19:40:33,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 19:40:33,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 19:40:33,713 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 19:40:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:34,000 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 19:40:34,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 19:40:34,001 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 19:40:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:34,002 INFO L225 Difference]: With dead ends: 84 [2018-12-03 19:40:34,002 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 19:40:34,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 19:40:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 19:40:34,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 19:40:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 19:40:34,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 19:40:34,006 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 19:40:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:34,006 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 19:40:34,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 19:40:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 19:40:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 19:40:34,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:34,007 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 19:40:34,008 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:34,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-12-03 19:40:34,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:34,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:34,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:36,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:36,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:36,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:36,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 19:40:36,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:36,150 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 19:40:36,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:40:36,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:40:36,203 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:40:36,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:36,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:36,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:42,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:42,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 19:40:42,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:42,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 19:40:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 19:40:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 19:40:42,461 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 19:40:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:42,607 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 19:40:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 19:40:42,608 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 19:40:42,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:42,609 INFO L225 Difference]: With dead ends: 85 [2018-12-03 19:40:42,609 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 19:40:42,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 19:40:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 19:40:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 19:40:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 19:40:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 19:40:42,613 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 19:40:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:42,613 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 19:40:42,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 19:40:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 19:40:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 19:40:42,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:42,614 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 19:40:42,614 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:42,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-12-03 19:40:42,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:42,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:42,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:42,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:42,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:45,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:45,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:45,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:45,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:45,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:45,086 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 19:40:45,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:45,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:40:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:45,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:45,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:51,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:51,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 19:40:51,515 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:51,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 19:40:51,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 19:40:51,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 19:40:51,517 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 19:40:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:51,623 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 19:40:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 19:40:51,624 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 19:40:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:51,624 INFO L225 Difference]: With dead ends: 86 [2018-12-03 19:40:51,625 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 19:40:51,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 19:40:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 19:40:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 19:40:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 19:40:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 19:40:51,628 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 19:40:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:51,628 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 19:40:51,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 19:40:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 19:40:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 19:40:51,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:51,629 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 19:40:51,629 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:51,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-12-03 19:40:51,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:51,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:51,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:53,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:53,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:53,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:53,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:53,861 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 19:40:53,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:40:53,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:40:53,952 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 19:40:53,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:53,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:53,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:00,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:00,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 19:41:00,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:00,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 19:41:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 19:41:00,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 19:41:00,698 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 19:41:00,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:00,853 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 19:41:00,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 19:41:00,853 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 19:41:00,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:00,854 INFO L225 Difference]: With dead ends: 87 [2018-12-03 19:41:00,854 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 19:41:00,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 19:41:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 19:41:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 19:41:00,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 19:41:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 19:41:00,858 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 19:41:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:00,858 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 19:41:00,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 19:41:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 19:41:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 19:41:00,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:00,859 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 19:41:00,859 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:00,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:00,859 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-12-03 19:41:00,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:00,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:00,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:03,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:03,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:03,328 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:03,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 19:41:03,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:03,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 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 19:41:03,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:41:03,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:41:03,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:41:03,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:03,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:03,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:10,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:10,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 19:41:10,510 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:10,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 19:41:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 19:41:10,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 19:41:10,511 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 19:41:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:10,723 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 19:41:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 19:41:10,724 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 19:41:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:10,724 INFO L225 Difference]: With dead ends: 88 [2018-12-03 19:41:10,724 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 19:41:10,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 19:41:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 19:41:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 19:41:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 19:41:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 19:41:10,728 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 19:41:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:10,728 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 19:41:10,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 19:41:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 19:41:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 19:41:10,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:10,729 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 19:41:10,729 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:10,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:10,729 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-12-03 19:41:10,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:10,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:10,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:10,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:10,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:13,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:13,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:13,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:13,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:13,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 19:41:13,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:13,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 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 19:41:13,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:13,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:41:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:13,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:13,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:20,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:20,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 19:41:20,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:20,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 19:41:20,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 19:41:20,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 19:41:20,510 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 19:41:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:20,730 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 19:41:20,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 19:41:20,730 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 19:41:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:20,731 INFO L225 Difference]: With dead ends: 89 [2018-12-03 19:41:20,731 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 19:41:20,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 19:41:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 19:41:20,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 19:41:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 19:41:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 19:41:20,735 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 19:41:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:20,735 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 19:41:20,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 19:41:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 19:41:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 19:41:20,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:20,736 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 19:41:20,736 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:20,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:20,736 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-12-03 19:41:20,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:20,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:20,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:20,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:20,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:23,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:23,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:23,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:23,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:23,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:23,136 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 19:41:23,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:41:23,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:41:23,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 19:41:23,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:23,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:23,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:30,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:30,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 19:41:30,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:30,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 19:41:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 19:41:30,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 19:41:30,223 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 19:41:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:30,429 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 19:41:30,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 19:41:30,430 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 19:41:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:30,431 INFO L225 Difference]: With dead ends: 90 [2018-12-03 19:41:30,431 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 19:41:30,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 19:41:30,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 19:41:30,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 19:41:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 19:41:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 19:41:30,435 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 19:41:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:30,435 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 19:41:30,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 19:41:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 19:41:30,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 19:41:30,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:30,436 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 19:41:30,436 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:30,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:30,436 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-12-03 19:41:30,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:30,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:30,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:30,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:32,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:32,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:32,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:32,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:32,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:32,883 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 19:41:32,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:41:32,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:41:32,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:41:32,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:32,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:32,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:40,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:40,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 19:41:40,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:40,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 19:41:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 19:41:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 19:41:40,110 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 19:41:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:40,292 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 19:41:40,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 19:41:40,293 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 19:41:40,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:40,294 INFO L225 Difference]: With dead ends: 91 [2018-12-03 19:41:40,294 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 19:41:40,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 19:41:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 19:41:40,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 19:41:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 19:41:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 19:41:40,299 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 19:41:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:40,299 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 19:41:40,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 19:41:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 19:41:40,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 19:41:40,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:40,300 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 19:41:40,300 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:40,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:40,300 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-12-03 19:41:40,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:40,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:40,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:40,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:42,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:42,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:42,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:42,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:42,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:42,929 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 19:41:42,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:42,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:41:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:42,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:43,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:50,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:50,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 19:41:50,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:50,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 19:41:50,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 19:41:50,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 19:41:50,289 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 19:41:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:50,464 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 19:41:50,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 19:41:50,465 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 19:41:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:50,466 INFO L225 Difference]: With dead ends: 92 [2018-12-03 19:41:50,466 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 19:41:50,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 19:41:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 19:41:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 19:41:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 19:41:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 19:41:50,469 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 19:41:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:50,469 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 19:41:50,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 19:41:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 19:41:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 19:41:50,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:50,470 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 19:41:50,470 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:50,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:50,470 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-12-03 19:41:50,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:50,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:50,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:50,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:53,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:53,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:53,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:53,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:53,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:53,022 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 19:41:53,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:41:53,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:41:53,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 19:41:53,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:53,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:53,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:00,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:00,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:00,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 19:42:00,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:00,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 19:42:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 19:42:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 19:42:00,747 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 19:42:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:00,926 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 19:42:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 19:42:00,927 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 19:42:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:00,927 INFO L225 Difference]: With dead ends: 93 [2018-12-03 19:42:00,928 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 19:42:00,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 19:42:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 19:42:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 19:42:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 19:42:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 19:42:00,931 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 19:42:00,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:00,931 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 19:42:00,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 19:42:00,931 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 19:42:00,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 19:42:00,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:00,932 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 19:42:00,932 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:00,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-12-03 19:42:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:00,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:00,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:03,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:03,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:03,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:03,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 19:42:03,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:03,631 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 19:42:03,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:42:03,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:42:03,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:42:03,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:42:03,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:03,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:11,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:11,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:11,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 19:42:11,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:11,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 19:42:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 19:42:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 19:42:11,378 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 19:42:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:11,491 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 19:42:11,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 19:42:11,492 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 19:42:11,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:11,492 INFO L225 Difference]: With dead ends: 94 [2018-12-03 19:42:11,493 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 19:42:11,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 19:42:11,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 19:42:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 19:42:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 19:42:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 19:42:11,496 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 19:42:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:11,496 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 19:42:11,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 19:42:11,497 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 19:42:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 19:42:11,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:11,497 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 19:42:11,497 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:11,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:11,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-12-03 19:42:11,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:11,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:11,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:11,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:11,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:14,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:14,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:14,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:14,204 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 19:42:14,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:14,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:42:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:14,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:14,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:22,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:22,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 19:42:22,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:22,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 19:42:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 19:42:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 19:42:22,096 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 19:42:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:22,277 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 19:42:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 19:42:22,277 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 19:42:22,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:22,278 INFO L225 Difference]: With dead ends: 95 [2018-12-03 19:42:22,278 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 19:42:22,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 19:42:22,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 19:42:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 19:42:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 19:42:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 19:42:22,283 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 19:42:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:22,283 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 19:42:22,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 19:42:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 19:42:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 19:42:22,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:22,284 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 19:42:22,284 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:22,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:22,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-12-03 19:42:22,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:22,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:22,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:22,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:22,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:25,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:25,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:25,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:25,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 19:42:25,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:25,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 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 19:42:25,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:42:25,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:42:25,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 19:42:25,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:42:25,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:25,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:25,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:33,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:33,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 19:42:33,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:33,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 19:42:33,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 19:42:33,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:42:33,313 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 19:42:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:33,446 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 19:42:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 19:42:33,447 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 19:42:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:33,448 INFO L225 Difference]: With dead ends: 96 [2018-12-03 19:42:33,448 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 19:42:33,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:42:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 19:42:33,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 19:42:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 19:42:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 19:42:33,451 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 19:42:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:33,451 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 19:42:33,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 19:42:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 19:42:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 19:42:33,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:33,452 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 19:42:33,452 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:33,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-12-03 19:42:33,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:33,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:33,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:33,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:33,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:36,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:36,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:36,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:36,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:36,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:36,243 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 19:42:36,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:42:36,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:42:36,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:42:36,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:42:36,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:36,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:44,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:44,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 19:42:44,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:44,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 19:42:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 19:42:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 19:42:44,505 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 19:42:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:44,707 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 19:42:44,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 19:42:44,708 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 19:42:44,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:44,709 INFO L225 Difference]: With dead ends: 97 [2018-12-03 19:42:44,709 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 19:42:44,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 19:42:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 19:42:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 19:42:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 19:42:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 19:42:44,713 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 19:42:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:44,714 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 19:42:44,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 19:42:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 19:42:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 19:42:44,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:44,715 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 19:42:44,715 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:44,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-12-03 19:42:44,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:44,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:42:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:44,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:47,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:47,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:47,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:47,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:42:47,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:47,579 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 19:42:47,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:47,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:42:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:47,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:47,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:42:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:56,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:42:56,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 19:42:56,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:42:56,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 19:42:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 19:42:56,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 19:42:56,019 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 19:42:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:42:56,159 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 19:42:56,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 19:42:56,160 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 19:42:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:42:56,161 INFO L225 Difference]: With dead ends: 98 [2018-12-03 19:42:56,161 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 19:42:56,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 19:42:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 19:42:56,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 19:42:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 19:42:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 19:42:56,165 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 19:42:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:42:56,165 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 19:42:56,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 19:42:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 19:42:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 19:42:56,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:42:56,165 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 19:42:56,166 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:42:56,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:42:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-12-03 19:42:56,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:42:56,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:56,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:42:56,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:42:56,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:42:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:42:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:59,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:59,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:42:59,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:42:59,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 19:42:59,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:42:59,094 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 19:42:59,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:42:59,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:42:59,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 19:42:59,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:42:59,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:42:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:42:59,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:07,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:07,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 19:43:07,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:07,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 19:43:07,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 19:43:07,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 19:43:07,741 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 19:43:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:07,870 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 19:43:07,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 19:43:07,870 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 19:43:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:07,871 INFO L225 Difference]: With dead ends: 99 [2018-12-03 19:43:07,871 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 19:43:07,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 19:43:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 19:43:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 19:43:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 19:43:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 19:43:07,875 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 19:43:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:07,876 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 19:43:07,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 19:43:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 19:43:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 19:43:07,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:07,876 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 19:43:07,876 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:07,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:07,877 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-12-03 19:43:07,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:07,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:07,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:07,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:10,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:10,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:10,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:10,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:10,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:10,887 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 19:43:10,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:43:10,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:43:10,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:43:10,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:43:10,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:10,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:10,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:19,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:19,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:19,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 19:43:19,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:19,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 19:43:19,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 19:43:19,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 19:43:19,755 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 19:43:19,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:19,905 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 19:43:19,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 19:43:19,906 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 19:43:19,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:19,906 INFO L225 Difference]: With dead ends: 100 [2018-12-03 19:43:19,907 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 19:43:19,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 19:43:19,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 19:43:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 19:43:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 19:43:19,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 19:43:19,910 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 19:43:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:19,911 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 19:43:19,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 19:43:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 19:43:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 19:43:19,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:19,911 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 19:43:19,911 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:19,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-12-03 19:43:19,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:19,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:19,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:22,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:22,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:22,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:22,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:22,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:22,971 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 19:43:22,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:43:22,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:43:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:23,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:23,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:31,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:31,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 19:43:31,918 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:31,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 19:43:31,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 19:43:31,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 19:43:31,920 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 19:43:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:32,081 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 19:43:32,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 19:43:32,082 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 19:43:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:32,082 INFO L225 Difference]: With dead ends: 101 [2018-12-03 19:43:32,082 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 19:43:32,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 19:43:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 19:43:32,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 19:43:32,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 19:43:32,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 19:43:32,086 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 19:43:32,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:32,087 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 19:43:32,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 19:43:32,087 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 19:43:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 19:43:32,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:32,088 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 19:43:32,088 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:32,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:32,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-12-03 19:43:32,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:32,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:43:32,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:32,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:35,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:35,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:35,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:35,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:35,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:35,475 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 19:43:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:43:35,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:43:35,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 19:43:35,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:43:35,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:35,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:44,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:44,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 19:43:44,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:44,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 19:43:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 19:43:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:43:44,668 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 19:43:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:44,813 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 19:43:44,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 19:43:44,814 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 19:43:44,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:44,814 INFO L225 Difference]: With dead ends: 102 [2018-12-03 19:43:44,815 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 19:43:44,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:43:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 19:43:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 19:43:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 19:43:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 19:43:44,819 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 19:43:44,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:44,819 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 19:43:44,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 19:43:44,819 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 19:43:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 19:43:44,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:44,820 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 19:43:44,820 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:44,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:44,820 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-12-03 19:43:44,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:44,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:44,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:44,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:43:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:47,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:47,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:43:47,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:43:47,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:43:47,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:43:47,975 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 19:43:47,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:43:47,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:43:48,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:43:48,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:43:48,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:43:48,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:48,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:43:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:43:57,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:43:57,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 19:43:57,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:43:57,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 19:43:57,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 19:43:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 19:43:57,333 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 19:43:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:43:57,497 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 19:43:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 19:43:57,497 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 19:43:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:43:57,498 INFO L225 Difference]: With dead ends: 103 [2018-12-03 19:43:57,498 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 19:43:57,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 19:43:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 19:43:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 19:43:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 19:43:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 19:43:57,503 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 19:43:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:43:57,503 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 19:43:57,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 19:43:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 19:43:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 19:43:57,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:43:57,504 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 19:43:57,504 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:43:57,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:43:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-12-03 19:43:57,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:43:57,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:57,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:43:57,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:43:57,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:43:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:00,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:00,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:00,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:00,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:00,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:00,739 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 19:44:00,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:00,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:44:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:00,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:00,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:10,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:10,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 19:44:10,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:10,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 19:44:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 19:44:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 19:44:10,358 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 19:44:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:10,577 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 19:44:10,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 19:44:10,577 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 19:44:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:10,578 INFO L225 Difference]: With dead ends: 104 [2018-12-03 19:44:10,578 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 19:44:10,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 19:44:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 19:44:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 19:44:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 19:44:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 19:44:10,583 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 19:44:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:10,583 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 19:44:10,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 19:44:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 19:44:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 19:44:10,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:10,584 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 19:44:10,584 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:10,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:10,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-12-03 19:44:10,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:10,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:10,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:10,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:13,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:13,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:13,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:13,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:13,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:13,894 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 19:44:13,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:44:13,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:44:13,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 19:44:13,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:13,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:14,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:23,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:23,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 19:44:23,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:23,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 19:44:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 19:44:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 19:44:23,701 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 19:44:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:23,967 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 19:44:23,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 19:44:23,967 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 19:44:23,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:23,968 INFO L225 Difference]: With dead ends: 105 [2018-12-03 19:44:23,968 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 19:44:23,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 19:44:23,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 19:44:23,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 19:44:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 19:44:23,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 19:44:23,972 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 19:44:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:23,972 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 19:44:23,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 19:44:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 19:44:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 19:44:23,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:23,973 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 19:44:23,973 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:23,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-12-03 19:44:23,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:23,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:23,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:44:23,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:23,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:27,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:27,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:27,350 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:27,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:27,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:27,350 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 19:44:27,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:44:27,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:44:27,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:44:27,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:27,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:27,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:27,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:37,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:37,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 19:44:37,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:37,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 19:44:37,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 19:44:37,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 19:44:37,302 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 19:44:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:37,458 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 19:44:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 19:44:37,459 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 19:44:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:37,460 INFO L225 Difference]: With dead ends: 106 [2018-12-03 19:44:37,460 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 19:44:37,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 19:44:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 19:44:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 19:44:37,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 19:44:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 19:44:37,465 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 19:44:37,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:37,465 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 19:44:37,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 19:44:37,465 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 19:44:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 19:44:37,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:37,466 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 19:44:37,466 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:37,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:37,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-12-03 19:44:37,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:37,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:37,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:44:37,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:37,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:40,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:40,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:40,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:40,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:40,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:40,933 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 19:44:40,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:40,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:44:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:40,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:41,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:51,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:51,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 19:44:51,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:51,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 19:44:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 19:44:51,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 19:44:51,062 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 19:44:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:51,350 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 19:44:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 19:44:51,351 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 19:44:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:51,352 INFO L225 Difference]: With dead ends: 107 [2018-12-03 19:44:51,352 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 19:44:51,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 19:44:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 19:44:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 19:44:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 19:44:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 19:44:51,356 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 19:44:51,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:51,357 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 19:44:51,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 19:44:51,357 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 19:44:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 19:44:51,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:51,358 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 19:44:51,358 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:51,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:51,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-12-03 19:44:51,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:51,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:51,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:54,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:54,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:54,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:54,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:54,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:54,868 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 19:44:54,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:44:54,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:44:54,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 19:44:54,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:54,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:55,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:05,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:05,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 19:45:05,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:05,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 19:45:05,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 19:45:05,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 19:45:05,246 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 19:45:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:05,501 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 19:45:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 19:45:05,502 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 19:45:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:05,503 INFO L225 Difference]: With dead ends: 108 [2018-12-03 19:45:05,503 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 19:45:05,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 19:45:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 19:45:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 19:45:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 19:45:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 19:45:05,507 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 19:45:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:05,508 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 19:45:05,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 19:45:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 19:45:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 19:45:05,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:05,509 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 19:45:05,509 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:05,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-12-03 19:45:05,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:05,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:05,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:45:05,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:05,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:09,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:09,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:09,165 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:09,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:09,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:09,165 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 19:45:09,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:45:09,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:45:09,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:45:09,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:45:09,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:09,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:19,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:19,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 19:45:19,749 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:19,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 19:45:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 19:45:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 19:45:19,751 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 19:45:19,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:19,986 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 19:45:19,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 19:45:19,987 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 19:45:19,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:19,988 INFO L225 Difference]: With dead ends: 109 [2018-12-03 19:45:19,988 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 19:45:19,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 19:45:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 19:45:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 19:45:19,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 19:45:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 19:45:19,992 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 19:45:19,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:19,992 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 19:45:19,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 19:45:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 19:45:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 19:45:19,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:19,992 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 19:45:19,993 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:19,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:19,993 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-12-03 19:45:19,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:19,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:45:19,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:19,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:23,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:23,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:23,658 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:23,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:23,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:23,658 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 19:45:23,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:45:23,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:45:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:23,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:23,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:34,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:34,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:34,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 19:45:34,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:34,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 19:45:34,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 19:45:34,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 19:45:34,514 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 19:45:34,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:34,841 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 19:45:34,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 19:45:34,841 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 19:45:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:34,842 INFO L225 Difference]: With dead ends: 110 [2018-12-03 19:45:34,842 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 19:45:34,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 19:45:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 19:45:34,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 19:45:34,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 19:45:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 19:45:34,846 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 19:45:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:34,847 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 19:45:34,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 19:45:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 19:45:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 19:45:34,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:34,848 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 19:45:34,848 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:34,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-12-03 19:45:34,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:34,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:45:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:34,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:38,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:38,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:38,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:38,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:38,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:38,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 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 19:45:38,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:45:38,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:45:38,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 19:45:38,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:45:38,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:38,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:45:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:49,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:45:49,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 19:45:49,632 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:45:49,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 19:45:49,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 19:45:49,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 19:45:49,634 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 19:45:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:45:49,909 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 19:45:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 19:45:49,910 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 19:45:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:45:49,910 INFO L225 Difference]: With dead ends: 111 [2018-12-03 19:45:49,911 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 19:45:49,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 19:45:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 19:45:49,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 19:45:49,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 19:45:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 19:45:49,915 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 19:45:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:45:49,915 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 19:45:49,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 19:45:49,915 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 19:45:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 19:45:49,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:45:49,915 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 19:45:49,916 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:45:49,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:45:49,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-12-03 19:45:49,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:45:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:49,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:45:49,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:45:49,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:45:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:45:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:53,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:53,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:45:53,729 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:45:53,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:45:53,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:45:53,729 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 19:45:53,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:45:53,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:45:53,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:45:53,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:45:53,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:45:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:45:53,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:04,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:04,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 19:46:04,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:04,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 19:46:04,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 19:46:04,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 19:46:04,927 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 19:46:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:05,207 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 19:46:05,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 19:46:05,207 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 19:46:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:05,208 INFO L225 Difference]: With dead ends: 112 [2018-12-03 19:46:05,208 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 19:46:05,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 19:46:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 19:46:05,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 19:46:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 19:46:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 19:46:05,212 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 19:46:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:05,212 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 19:46:05,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 19:46:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 19:46:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 19:46:05,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:05,213 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 19:46:05,213 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:05,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-12-03 19:46:05,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:05,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:05,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:46:05,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:05,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:09,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:09,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:09,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:09,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 19:46:09,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:09,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 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 19:46:09,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:09,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:46:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:09,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:09,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:20,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:20,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 19:46:20,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:20,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 19:46:20,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 19:46:20,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 19:46:20,451 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 19:46:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:20,747 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 19:46:20,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 19:46:20,748 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 19:46:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:20,748 INFO L225 Difference]: With dead ends: 113 [2018-12-03 19:46:20,748 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 19:46:20,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 19:46:20,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 19:46:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 19:46:20,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 19:46:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 19:46:20,753 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 19:46:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:20,753 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 19:46:20,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 19:46:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 19:46:20,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 19:46:20,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:20,754 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 19:46:20,754 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:20,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:20,754 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-12-03 19:46:20,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:20,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:20,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:20,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:24,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:24,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:24,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:24,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 19:46:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:24,638 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 19:46:24,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:46:24,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:46:24,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 19:46:24,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:24,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:24,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:36,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:36,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 19:46:36,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:36,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 19:46:36,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 19:46:36,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 19:46:36,257 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 19:46:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:36,497 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 19:46:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 19:46:36,497 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 19:46:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:36,498 INFO L225 Difference]: With dead ends: 114 [2018-12-03 19:46:36,498 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 19:46:36,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 19:46:36,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 19:46:36,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 19:46:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 19:46:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 19:46:36,502 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 19:46:36,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:36,502 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 19:46:36,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 19:46:36,502 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 19:46:36,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 19:46:36,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:36,503 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 19:46:36,503 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:36,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-12-03 19:46:36,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:36,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:36,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:46:36,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:36,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:40,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:40,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:40,508 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:40,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:40,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:40,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:40,508 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 19:46:40,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:46:40,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:46:40,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:46:40,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:40,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:40,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:52,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:52,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 19:46:52,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:52,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 19:46:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 19:46:52,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 19:46:52,269 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 19:46:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:52,511 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 19:46:52,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 19:46:52,511 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 19:46:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:52,512 INFO L225 Difference]: With dead ends: 115 [2018-12-03 19:46:52,512 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 19:46:52,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 19:46:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 19:46:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 19:46:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 19:46:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 19:46:52,516 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 19:46:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:52,517 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 19:46:52,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 19:46:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 19:46:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 19:46:52,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:52,517 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 19:46:52,517 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:52,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-12-03 19:46:52,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:52,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:46:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:52,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:56,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:56,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:56,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:56,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 19:46:56,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:56,538 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 19:46:56,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:56,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:46:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:56,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:56,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:47:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:08,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:47:08,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 19:47:08,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:47:08,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 19:47:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 19:47:08,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 19:47:08,525 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 19:47:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:47:08,823 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 19:47:08,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 19:47:08,824 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 19:47:08,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:47:08,825 INFO L225 Difference]: With dead ends: 116 [2018-12-03 19:47:08,825 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 19:47:08,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 19:47:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 19:47:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 19:47:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 19:47:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 19:47:08,830 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 19:47:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:47:08,830 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 19:47:08,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 19:47:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 19:47:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 19:47:08,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:47:08,831 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 19:47:08,831 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:47:08,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:47:08,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-12-03 19:47:08,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:47:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:08,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:47:08,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:08,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:47:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:47:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:12,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:12,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:47:12,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:47:12,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:47:12,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:12,990 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 19:47:12,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:47:12,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:47:13,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 19:47:13,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:47:13,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:47:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:13,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:47:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:25,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:47:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 19:47:25,324 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:47:25,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 19:47:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 19:47:25,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 19:47:25,327 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 19:47:25,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:47:25,495 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 19:47:25,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 19:47:25,496 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 19:47:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:47:25,496 INFO L225 Difference]: With dead ends: 117 [2018-12-03 19:47:25,497 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 19:47:25,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 19:47:25,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 19:47:25,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 19:47:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 19:47:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 19:47:25,502 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 19:47:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:47:25,502 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 19:47:25,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 19:47:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 19:47:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 19:47:25,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:47:25,503 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 19:47:25,503 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:47:25,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:47:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-12-03 19:47:25,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:47:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:25,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:47:25,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:25,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:47:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:47:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:29,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:29,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:47:29,674 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:47:29,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:47:29,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:29,674 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 19:47:29,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:47:29,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:47:29,745 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:47:29,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:47:29,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:47:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:29,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:47:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:42,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:47:42,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 19:47:42,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:47:42,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 19:47:42,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 19:47:42,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 19:47:42,070 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-12-03 19:47:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:47:42,407 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 19:47:42,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 19:47:42,407 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-12-03 19:47:42,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:47:42,408 INFO L225 Difference]: With dead ends: 118 [2018-12-03 19:47:42,408 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 19:47:42,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 19:47:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 19:47:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 19:47:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 19:47:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 19:47:42,412 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-12-03 19:47:42,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:47:42,413 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 19:47:42,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 19:47:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 19:47:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 19:47:42,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:47:42,413 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-12-03 19:47:42,413 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:47:42,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:47:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-12-03 19:47:42,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:47:42,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:42,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:47:42,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:42,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:47:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:47:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:46,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:46,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:47:46,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:47:46,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 19:47:46,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:47:46,631 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 19:47:46,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:47:46,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:47:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:47:46,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:47:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:46,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:47:59,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:47:59,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:47:59,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114, 114, 114] total 227 [2018-12-03 19:47:59,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:47:59,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-03 19:47:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-03 19:47:59,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-03 19:47:59,266 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-12-03 19:47:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:47:59,546 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 19:47:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 19:47:59,547 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-12-03 19:47:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:47:59,547 INFO L225 Difference]: With dead ends: 119 [2018-12-03 19:47:59,547 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 19:47:59,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-12-03 19:47:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 19:47:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 19:47:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 19:47:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-12-03 19:47:59,552 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-12-03 19:47:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:47:59,552 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-12-03 19:47:59,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-03 19:47:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-12-03 19:47:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 19:47:59,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:47:59,553 INFO L402 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-12-03 19:47:59,553 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:47:59,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:47:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-12-03 19:47:59,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:47:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:59,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:47:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:47:59,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:47:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:48:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:03,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:03,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:48:03,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:48:03,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:48:03,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:03,934 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 19:48:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:48:03,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:48:04,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 19:48:04,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:48:04,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:48:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:04,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:48:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:16,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:48:16,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 229 [2018-12-03 19:48:16,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:48:16,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 19:48:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 19:48:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 19:48:16,789 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-12-03 19:48:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:48:16,973 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-03 19:48:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 19:48:16,973 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-12-03 19:48:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:48:16,974 INFO L225 Difference]: With dead ends: 120 [2018-12-03 19:48:16,974 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 19:48:16,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 19:48:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 19:48:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 19:48:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 19:48:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 19:48:16,978 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-12-03 19:48:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:48:16,978 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 19:48:16,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 19:48:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 19:48:16,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 19:48:16,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:48:16,979 INFO L402 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-12-03 19:48:16,979 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:48:16,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:48:16,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-12-03 19:48:16,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:48:16,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:16,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:48:16,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:16,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:48:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:48:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:21,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:21,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:48:21,376 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:48:21,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:48:21,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:21,377 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 19:48:21,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:48:21,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:48:21,449 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:48:21,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:48:21,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:48:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:21,491 INFO L316 TraceCheckSpWp]: Computing backward predicates...