java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:21:54,414 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:21:54,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:21:54,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:21:54,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:21:54,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:21:54,431 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:21:54,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:21:54,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:21:54,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:21:54,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:21:54,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:21:54,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:21:54,438 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:21:54,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:21:54,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:21:54,441 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:21:54,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:21:54,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:21:54,447 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:21:54,448 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:21:54,450 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:21:54,452 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:21:54,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:21:54,453 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:21:54,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:21:54,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:21:54,456 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:21:54,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:21:54,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:21:54,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:21:54,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:21:54,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:21:54,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:21:54,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:21:54,461 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:21:54,462 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:21:54,487 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:21:54,488 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:21:54,488 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:21:54,489 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:21:54,489 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:21:54,489 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:21:54,489 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:21:54,489 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:21:54,490 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:21:54,490 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:21:54,490 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:21:54,490 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:21:54,490 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:21:54,491 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:21:54,491 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:21:54,492 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:21:54,492 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:21:54,492 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:21:54,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:21:54,494 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:21:54,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:21:54,495 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:21:54,495 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:21:54,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:21:54,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:21:54,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:21:54,496 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:21:54,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:21:54,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:21:54,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:21:54,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:21:54,496 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:21:54,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:54,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:21:54,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:21:54,498 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:21:54,498 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:21:54,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:21:54,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:21:54,499 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:21:54,499 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:21:54,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:21:54,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:21:54,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:21:54,565 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:21:54,566 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:21:54,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-12-03 15:21:54,567 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/nested1.i_4.bplTransformedIcfg_BEv2_12.bpl' [2018-12-03 15:21:54,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:21:54,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:21:54,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:54,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:21:54,628 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:21:54,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:54,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:21:54,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:21:54,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:21:54,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... [2018-12-03 15:21:54,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:21:54,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:21:54,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:21:54,695 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:21:54,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:54,767 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:21:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:21:54,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:21:55,016 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:21:55,016 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:21:55,017 INFO L202 PluginConnector]: Adding new model nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:55 BoogieIcfgContainer [2018-12-03 15:21:55,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:21:55,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:21:55,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:21:55,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:21:55,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:54" (1/2) ... [2018-12-03 15:21:55,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285a33d1 and model type nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:21:55, skipping insertion in model container [2018-12-03 15:21:55,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bplTransformedIcfg_BEv2_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:55" (2/2) ... [2018-12-03 15:21:55,025 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bplTransformedIcfg_BEv2_12.bpl [2018-12-03 15:21:55,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:21:55,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:21:55,061 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:21:55,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:21:55,098 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:21:55,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:21:55,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:21:55,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:21:55,099 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:21:55,099 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:21:55,099 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:21:55,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-03 15:21:55,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:21:55,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:55,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:21:55,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:55,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:21:55,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:55,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:55,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:55,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:55,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:21:55,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:55,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:55,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:55,349 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-03 15:21:55,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:55,425 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 15:21:55,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:55,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:21:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:55,448 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:21:55,448 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:21:55,463 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 15:21:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:21:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 15:21:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:21:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-03 15:21:55,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-12-03 15:21:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:55,497 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-03 15:21:55,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-03 15:21:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:21:55,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:55,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:21:55,498 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:55,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:55,498 INFO L82 PathProgramCache]: Analyzing trace with hash 28854189, now seen corresponding path program 1 times [2018-12-03 15:21:55,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:55,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:55,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:55,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:55,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:21:55,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:55,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:55,530 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 3 states. [2018-12-03 15:21:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:55,580 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-03 15:21:55,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:55,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 15:21:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:55,581 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:21:55,582 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:21:55,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:55,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:21:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:21:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:21:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:21:55,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 15:21:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:55,586 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:21:55,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:55,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:21:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:21:55,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:55,587 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:21:55,588 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:55,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:55,588 INFO L82 PathProgramCache]: Analyzing trace with hash 894431694, now seen corresponding path program 1 times [2018-12-03 15:21:55,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:55,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:55,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:55,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:55,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:55,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:55,742 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 15:21:55,744 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2018-12-03 15:21:55,806 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:55,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:56,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:56,142 INFO L272 AbstractInterpreter]: Visited 6 different actions 22 times. Merged at 5 different actions 11 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:21:56,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:56,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:56,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:56,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:56,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:56,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:56,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-03 15:21:56,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:56,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:56,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:56,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:56,372 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 15:21:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:56,398 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 15:21:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:56,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:21:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:56,400 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:21:56,400 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:21:56,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:56,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:21:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:21:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:21:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 15:21:56,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 15:21:56,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:56,405 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 15:21:56,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 15:21:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:21:56,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:56,406 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 15:21:56,406 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:56,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1957530573, now seen corresponding path program 2 times [2018-12-03 15:21:56,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:56,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:21:56,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:56,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:56,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:56,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:56,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:56,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:56,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:21:56,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:56,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:21:56,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:56,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 15:21:56,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:56,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:21:56,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:56,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:56,582 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 15:21:56,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:56,652 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-12-03 15:21:56,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:56,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 15:21:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:56,656 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:21:56,656 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:21:56,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:21:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 15:21:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:21:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 15:21:56,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 7 [2018-12-03 15:21:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:56,668 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 15:21:56,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 15:21:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:21:56,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:56,669 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-12-03 15:21:56,669 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:56,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash 201207191, now seen corresponding path program 3 times [2018-12-03 15:21:56,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:56,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:56,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:56,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:56,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:56,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:56,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:56,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:56,967 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:56,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:56,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:56,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 15:21:57,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:57,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-12-03 15:21:57,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:57,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:21:57,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:21:57,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:57,142 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 5 states. [2018-12-03 15:21:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,179 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 15:21:57,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:21:57,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-03 15:21:57,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,181 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:21:57,181 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:21:57,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:21:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:21:57,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:21:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 15:21:57,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 15:21:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,187 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 15:21:57,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:21:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 15:21:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:21:57,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,188 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1] [2018-12-03 15:21:57,188 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1143121891, now seen corresponding path program 4 times [2018-12-03 15:21:57,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:21:57,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:57,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:57,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:57,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:57,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:21:57,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:21:57,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:57,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2018-12-03 15:21:57,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:57,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:21:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:21:57,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:57,587 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 6 states. [2018-12-03 15:21:57,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,618 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2018-12-03 15:21:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:21:57,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-12-03 15:21:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,624 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:21:57,624 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:21:57,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:21:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:21:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:21:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 15:21:57,629 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 15:21:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,630 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 15:21:57,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:21:57,630 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 15:21:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:21:57,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,631 INFO L402 BasicCegarLoop]: trace histogram [8, 2, 2, 1, 1, 1] [2018-12-03 15:21:57,631 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1762706263, now seen corresponding path program 5 times [2018-12-03 15:21:57,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 15:21:57,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:57,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:57,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:57,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:57,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:57,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:57,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:21:57,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:57,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:57,819 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:21:57,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 15:21:58,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:58,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 15 [2018-12-03 15:21:58,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:58,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:21:58,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:21:58,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:21:58,249 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 10 states. [2018-12-03 15:21:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:58,717 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-12-03 15:21:58,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:21:58,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 15:21:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:58,720 INFO L225 Difference]: With dead ends: 40 [2018-12-03 15:21:58,720 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:21:58,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=540, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:21:58,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:21:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2018-12-03 15:21:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:21:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-03 15:21:58,728 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-12-03 15:21:58,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:58,728 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-03 15:21:58,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:21:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-03 15:21:58,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:21:58,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:58,729 INFO L402 BasicCegarLoop]: trace histogram [15, 3, 3, 1, 1, 1] [2018-12-03 15:21:58,730 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:58,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:58,730 INFO L82 PathProgramCache]: Analyzing trace with hash 198739950, now seen corresponding path program 6 times [2018-12-03 15:21:58,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:58,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 15:21:58,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,904 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,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 15:21:58,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:58,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:58,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:58,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:58,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:58,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 15:21:59,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-03 15:21:59,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:59,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2018-12-03 15:21:59,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:59,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:21:59,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:21:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:21:59,448 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2018-12-03 15:22:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,072 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-12-03 15:22:00,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:22:00,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-12-03 15:22:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,074 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:22:00,074 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:22:00,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=554, Invalid=1006, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:22:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:22:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-12-03 15:22:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:22:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-12-03 15:22:00,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-12-03 15:22:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,084 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-03 15:22:00,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:22:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-12-03 15:22:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:22:00,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,086 INFO L402 BasicCegarLoop]: trace histogram [24, 4, 4, 1, 1, 1] [2018-12-03 15:22:00,086 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1597467349, now seen corresponding path program 7 times [2018-12-03 15:22:00,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:00,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 15:22:00,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:00,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:00,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:00,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:00,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 15:22:00,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 151 proven. 21 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-03 15:22:00,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2018-12-03 15:22:00,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:22:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:22:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:22:00,431 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-12-03 15:22:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,466 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-12-03 15:22:00,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:22:00,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-12-03 15:22:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,470 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:22:00,470 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:22:00,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:22:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:22:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:22:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:22:00,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-12-03 15:22:00,481 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 35 [2018-12-03 15:22:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,481 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-12-03 15:22:00,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:22:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-12-03 15:22:00,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:22:00,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,483 INFO L402 BasicCegarLoop]: trace histogram [28, 4, 4, 1, 1, 1] [2018-12-03 15:22:00,483 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1404785213, now seen corresponding path program 8 times [2018-12-03 15:22:00,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 394 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-03 15:22:00,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:00,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:00,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:00,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:00,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:00,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:00,722 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:22:00,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:00,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-03 15:22:00,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 196 proven. 28 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-12-03 15:22:00,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 17 [2018-12-03 15:22:00,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:22:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:22:00,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:22:00,983 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 15 states. [2018-12-03 15:22:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,633 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-12-03 15:22:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:22:02,633 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 15:22:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,634 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:22:02,634 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:22:02,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1046, Invalid=2146, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:22:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:22:02,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-12-03 15:22:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:22:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-03 15:22:02,648 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 39 [2018-12-03 15:22:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,649 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-03 15:22:02,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:22:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-03 15:22:02,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:22:02,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,651 INFO L402 BasicCegarLoop]: trace histogram [40, 5, 5, 1, 1, 1] [2018-12-03 15:22:02,651 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1154943019, now seen corresponding path program 9 times [2018-12-03 15:22:02,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 825 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-03 15:22:02,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:02,808 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:02,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:02,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:02,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:02,879 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:02,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:02,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-12-03 15:22:03,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 329 proven. 36 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-12-03 15:22:03,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:03,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 18 [2018-12-03 15:22:03,238 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:03,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:22:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:22:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:22:03,239 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 17 states. [2018-12-03 15:22:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:04,746 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-03 15:22:04,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:22:04,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2018-12-03 15:22:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:04,753 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:22:04,753 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:22:04,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1557 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1605, Invalid=3507, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:22:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:22:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 70. [2018-12-03 15:22:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:22:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-12-03 15:22:04,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 53 [2018-12-03 15:22:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:04,773 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-12-03 15:22:04,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:22:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-12-03 15:22:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:22:04,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:04,778 INFO L402 BasicCegarLoop]: trace histogram [54, 6, 6, 1, 1, 1] [2018-12-03 15:22:04,778 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:04,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash -2076506525, now seen corresponding path program 10 times [2018-12-03 15:22:04,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:04,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:04,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2018-12-03 15:22:05,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:05,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:05,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:05,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:05,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:05,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:05,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-03 15:22:05,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1791 backedges. 506 proven. 45 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-12-03 15:22:05,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:05,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 19 [2018-12-03 15:22:05,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:05,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:22:05,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:22:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:22:05,589 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 19 states. [2018-12-03 15:22:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:08,343 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2018-12-03 15:22:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:22:08,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-12-03 15:22:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:08,344 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:22:08,345 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:22:08,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 10 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2580 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2376, Invalid=5456, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:22:08,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:22:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-12-03 15:22:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:22:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2018-12-03 15:22:08,362 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 69 [2018-12-03 15:22:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:08,363 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2018-12-03 15:22:08,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:22:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2018-12-03 15:22:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:22:08,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:08,364 INFO L402 BasicCegarLoop]: trace histogram [70, 7, 7, 1, 1, 1] [2018-12-03 15:22:08,364 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:08,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -815084279, now seen corresponding path program 11 times [2018-12-03 15:22:08,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:08,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:08,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:08,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:22:08,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:08,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:08,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 15:22:08,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:08,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:08,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:08,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:22:08,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:08,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:22:08,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2954 backedges. 0 proven. 2569 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2018-12-03 15:22:08,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:08,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:22:08,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:08,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:22:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:22:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:22:08,975 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 10 states. [2018-12-03 15:22:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,255 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-03 15:22:09,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:22:09,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 87 [2018-12-03 15:22:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,256 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:22:09,256 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:22:09,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 165 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 15:22:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:22:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-12-03 15:22:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:22:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-12-03 15:22:09,286 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 87 [2018-12-03 15:22:09,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,286 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-12-03 15:22:09,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:22:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-12-03 15:22:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:22:09,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:09,289 INFO L402 BasicCegarLoop]: trace histogram [80, 8, 8, 1, 1, 1] [2018-12-03 15:22:09,290 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:09,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 558484307, now seen corresponding path program 12 times [2018-12-03 15:22:09,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:22:09,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:09,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:09,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:09,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:09,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:09,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:09,613 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:09,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:09,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:09,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:09,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:22:09,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:09,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3864 backedges. 0 proven. 3424 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-12-03 15:22:09,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:09,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:22:09,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:09,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:22:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:22:09,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:22:09,923 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 11 states. [2018-12-03 15:22:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:10,100 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-12-03 15:22:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:22:10,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-03 15:22:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:10,101 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:22:10,101 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:22:10,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:22:10,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:22:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2018-12-03 15:22:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:22:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-12-03 15:22:10,123 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 99 [2018-12-03 15:22:10,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:10,123 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-12-03 15:22:10,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:22:10,124 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-12-03 15:22:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:22:10,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:10,126 INFO L402 BasicCegarLoop]: trace histogram [90, 9, 9, 1, 1, 1] [2018-12-03 15:22:10,126 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:10,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2005161315, now seen corresponding path program 13 times [2018-12-03 15:22:10,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:10,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:10,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:10,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:10,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:22:10,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:10,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:10,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:10,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:10,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:10,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:10,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:10,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:10,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:22:10,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4896 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-12-03 15:22:10,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:10,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:22:10,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:10,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:22:10,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:22:10,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:22:10,761 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 12 states. [2018-12-03 15:22:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:10,955 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-12-03 15:22:10,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:22:10,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 111 [2018-12-03 15:22:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:10,957 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:22:10,958 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:22:10,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:22:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:22:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 124. [2018-12-03 15:22:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:22:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-12-03 15:22:10,985 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 111 [2018-12-03 15:22:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:10,986 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-12-03 15:22:10,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:22:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-12-03 15:22:10,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:22:10,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:10,988 INFO L402 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1] [2018-12-03 15:22:10,988 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:10,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1028199705, now seen corresponding path program 14 times [2018-12-03 15:22:10,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:10,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:10,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:10,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:11,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 15:22:11,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:11,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:11,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:11,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:11,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:11,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:11,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:11,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:11,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 15:22:11,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:11,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 15:22:11,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 0 proven. 5500 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2018-12-03 15:22:12,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:12,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:22:12,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:12,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:22:12,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:22:12,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:22:12,529 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 13 states. [2018-12-03 15:22:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:12,767 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-12-03 15:22:12,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:22:12,768 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 123 [2018-12-03 15:22:12,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:12,769 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:22:12,769 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:22:12,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:22:12,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:22:12,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-12-03 15:22:12,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:22:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-12-03 15:22:12,795 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 123 [2018-12-03 15:22:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:12,796 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-12-03 15:22:12,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:22:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-12-03 15:22:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:22:12,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:12,799 INFO L402 BasicCegarLoop]: trace histogram [110, 11, 11, 1, 1, 1] [2018-12-03 15:22:12,799 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:12,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash 804391985, now seen corresponding path program 15 times [2018-12-03 15:22:12,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:12,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:12,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 15:22:13,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:13,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:13,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:13,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:13,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:13,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:13,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:13,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:13,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:13,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:13,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 15:22:13,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7326 backedges. 0 proven. 6721 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2018-12-03 15:22:13,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:13,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:22:13,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:13,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:22:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:22:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:22:13,583 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 14 states. [2018-12-03 15:22:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:13,770 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-12-03 15:22:13,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:22:13,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-12-03 15:22:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:13,772 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:22:13,772 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 15:22:13,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:22:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 15:22:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 148. [2018-12-03 15:22:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 15:22:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-12-03 15:22:13,797 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 135 [2018-12-03 15:22:13,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:13,797 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-12-03 15:22:13,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:22:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-12-03 15:22:13,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 15:22:13,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:13,799 INFO L402 BasicCegarLoop]: trace histogram [120, 12, 12, 1, 1, 1] [2018-12-03 15:22:13,799 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:13,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1919127163, now seen corresponding path program 16 times [2018-12-03 15:22:13,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:13,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:14,084 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 15:22:14,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:14,085 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:14,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:14,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:14,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:14,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:14,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 15:22:14,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8724 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-12-03 15:22:14,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:14,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:22:14,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:14,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:22:14,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:22:14,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:22:14,567 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 15 states. [2018-12-03 15:22:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:14,804 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-12-03 15:22:14,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:22:14,804 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2018-12-03 15:22:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:14,805 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:22:14,805 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:22:14,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:22:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:22:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160. [2018-12-03 15:22:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 15:22:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 173 transitions. [2018-12-03 15:22:14,837 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 173 transitions. Word has length 147 [2018-12-03 15:22:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:14,837 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 173 transitions. [2018-12-03 15:22:14,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:22:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 173 transitions. [2018-12-03 15:22:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 15:22:14,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:14,839 INFO L402 BasicCegarLoop]: trace histogram [130, 13, 13, 1, 1, 1] [2018-12-03 15:22:14,839 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:14,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash 243397061, now seen corresponding path program 17 times [2018-12-03 15:22:14,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:14,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:14,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:14,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:14,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 15:22:15,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:15,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:15,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:15,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:15,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:15,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:15,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:15,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:15,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 15:22:15,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:15,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:15,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 15:22:15,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10244 backedges. 0 proven. 9529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-12-03 15:22:15,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:15,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:22:15,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:15,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:22:15,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:22:15,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:22:15,860 INFO L87 Difference]: Start difference. First operand 160 states and 173 transitions. Second operand 16 states. [2018-12-03 15:22:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:15,953 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-12-03 15:22:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:22:15,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2018-12-03 15:22:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:15,955 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:22:15,955 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 15:22:15,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 303 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 15:22:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 15:22:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2018-12-03 15:22:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 15:22:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-12-03 15:22:15,986 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 159 [2018-12-03 15:22:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:15,987 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-12-03 15:22:15,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:22:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-12-03 15:22:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 15:22:15,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:15,989 INFO L402 BasicCegarLoop]: trace histogram [140, 14, 14, 1, 1, 1] [2018-12-03 15:22:15,990 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:15,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:15,990 INFO L82 PathProgramCache]: Analyzing trace with hash 184792591, now seen corresponding path program 18 times [2018-12-03 15:22:15,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:15,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:15,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:15,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:15,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 15:22:16,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:16,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:16,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:16,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:16,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:16,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:16,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:16,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:16,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:16,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 15:22:16,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11886 backedges. 0 proven. 11116 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2018-12-03 15:22:17,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:17,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 15:22:17,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:17,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:22:17,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:22:17,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:22:17,174 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 17 states. [2018-12-03 15:22:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:17,268 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-12-03 15:22:17,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:22:17,273 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 171 [2018-12-03 15:22:17,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:17,274 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:22:17,274 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 15:22:17,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:22:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 15:22:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2018-12-03 15:22:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 15:22:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 199 transitions. [2018-12-03 15:22:17,307 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 199 transitions. Word has length 171 [2018-12-03 15:22:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:17,307 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 199 transitions. [2018-12-03 15:22:17,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:22:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 199 transitions. [2018-12-03 15:22:17,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 15:22:17,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:17,310 INFO L402 BasicCegarLoop]: trace histogram [150, 15, 15, 1, 1, 1] [2018-12-03 15:22:17,310 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:17,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:17,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1864410279, now seen corresponding path program 19 times [2018-12-03 15:22:17,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:17,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:17,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:17,644 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 15:22:17,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:17,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:17,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:17,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:17,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:17,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:17,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:17,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:17,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 15:22:17,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13650 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2018-12-03 15:22:18,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:18,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:22:18,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:18,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:22:18,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:22:18,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:22:18,186 INFO L87 Difference]: Start difference. First operand 184 states and 199 transitions. Second operand 18 states. [2018-12-03 15:22:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:18,286 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-12-03 15:22:18,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:22:18,286 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2018-12-03 15:22:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:18,287 INFO L225 Difference]: With dead ends: 209 [2018-12-03 15:22:18,287 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 15:22:18,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:22:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 15:22:18,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2018-12-03 15:22:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 15:22:18,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 212 transitions. [2018-12-03 15:22:18,328 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 212 transitions. Word has length 183 [2018-12-03 15:22:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:18,329 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 212 transitions. [2018-12-03 15:22:18,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:22:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 212 transitions. [2018-12-03 15:22:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 15:22:18,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:18,331 INFO L402 BasicCegarLoop]: trace histogram [160, 16, 16, 1, 1, 1] [2018-12-03 15:22:18,331 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:18,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:18,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1957994077, now seen corresponding path program 20 times [2018-12-03 15:22:18,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:18,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:18,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:18,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 15:22:18,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:18,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:18,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:18,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:18,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:18,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:18,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:18,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:19,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 97 check-sat command(s) [2018-12-03 15:22:19,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:19,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:19,169 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 15:22:19,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15536 backedges. 0 proven. 14656 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-12-03 15:22:19,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:19,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:22:19,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:19,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:22:19,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:22:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:22:19,589 INFO L87 Difference]: Start difference. First operand 196 states and 212 transitions. Second operand 19 states. [2018-12-03 15:22:19,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:19,691 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-12-03 15:22:19,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:22:19,693 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 195 [2018-12-03 15:22:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:19,694 INFO L225 Difference]: With dead ends: 221 [2018-12-03 15:22:19,694 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 15:22:19,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:22:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 15:22:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2018-12-03 15:22:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-03 15:22:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 225 transitions. [2018-12-03 15:22:19,730 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 225 transitions. Word has length 195 [2018-12-03 15:22:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:19,730 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 225 transitions. [2018-12-03 15:22:19,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:22:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 225 transitions. [2018-12-03 15:22:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 15:22:19,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:19,732 INFO L402 BasicCegarLoop]: trace histogram [170, 17, 17, 1, 1, 1] [2018-12-03 15:22:19,732 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:19,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1203652845, now seen corresponding path program 21 times [2018-12-03 15:22:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:19,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:19,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 15:22:20,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:20,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:20,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:20,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:20,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:20,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:20,436 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:20,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:20,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:20,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:20,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:20,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 15:22:20,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17544 backedges. 0 proven. 16609 refuted. 0 times theorem prover too weak. 935 trivial. 0 not checked. [2018-12-03 15:22:21,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:21,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:22:21,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:21,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:22:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:22:21,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:22:21,122 INFO L87 Difference]: Start difference. First operand 208 states and 225 transitions. Second operand 20 states. [2018-12-03 15:22:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:21,257 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-12-03 15:22:21,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:22:21,257 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 207 [2018-12-03 15:22:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:21,259 INFO L225 Difference]: With dead ends: 233 [2018-12-03 15:22:21,259 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 15:22:21,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 395 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 15:22:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 15:22:21,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2018-12-03 15:22:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 15:22:21,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 238 transitions. [2018-12-03 15:22:21,308 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 238 transitions. Word has length 207 [2018-12-03 15:22:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:21,309 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 238 transitions. [2018-12-03 15:22:21,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:22:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 238 transitions. [2018-12-03 15:22:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 15:22:21,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:21,310 INFO L402 BasicCegarLoop]: trace histogram [180, 18, 18, 1, 1, 1] [2018-12-03 15:22:21,310 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:21,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:21,311 INFO L82 PathProgramCache]: Analyzing trace with hash 367956279, now seen corresponding path program 22 times [2018-12-03 15:22:21,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:21,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:21,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:21,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:21,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 15:22:21,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:21,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:21,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:21,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:21,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:21,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:21,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:21,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 15:22:21,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:22,313 INFO L134 CoverageAnalysis]: Checked inductivity of 19674 backedges. 0 proven. 18684 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 15:22:22,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:22,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:22:22,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:22,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:22:22,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:22:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:22:22,336 INFO L87 Difference]: Start difference. First operand 220 states and 238 transitions. Second operand 21 states. [2018-12-03 15:22:22,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:22,463 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-12-03 15:22:22,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:22:22,463 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 219 [2018-12-03 15:22:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:22,464 INFO L225 Difference]: With dead ends: 245 [2018-12-03 15:22:22,464 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 15:22:22,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:22:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 15:22:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2018-12-03 15:22:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 15:22:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 251 transitions. [2018-12-03 15:22:22,514 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 251 transitions. Word has length 219 [2018-12-03 15:22:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:22,515 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 251 transitions. [2018-12-03 15:22:22,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:22:22,515 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 251 transitions. [2018-12-03 15:22:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-03 15:22:22,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:22,516 INFO L402 BasicCegarLoop]: trace histogram [190, 19, 19, 1, 1, 1] [2018-12-03 15:22:22,516 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:22,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash -405620095, now seen corresponding path program 23 times [2018-12-03 15:22:22,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:22,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:22,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 15:22:23,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:23,617 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:23,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:23,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:23,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:23,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:23,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 110 check-sat command(s) [2018-12-03 15:22:23,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:23,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 15:22:24,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21926 backedges. 0 proven. 20881 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2018-12-03 15:22:24,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:24,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:22:24,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:24,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:22:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:22:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:22:24,531 INFO L87 Difference]: Start difference. First operand 232 states and 251 transitions. Second operand 22 states. [2018-12-03 15:22:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:24,706 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-12-03 15:22:24,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:22:24,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 231 [2018-12-03 15:22:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:24,708 INFO L225 Difference]: With dead ends: 257 [2018-12-03 15:22:24,708 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 15:22:24,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:22:24,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 15:22:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 244. [2018-12-03 15:22:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-03 15:22:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 264 transitions. [2018-12-03 15:22:24,767 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 264 transitions. Word has length 231 [2018-12-03 15:22:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:24,767 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 264 transitions. [2018-12-03 15:22:24,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:22:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 264 transitions. [2018-12-03 15:22:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 15:22:24,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:24,769 INFO L402 BasicCegarLoop]: trace histogram [200, 20, 20, 1, 1, 1] [2018-12-03 15:22:24,769 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:24,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:24,770 INFO L82 PathProgramCache]: Analyzing trace with hash -241089333, now seen corresponding path program 24 times [2018-12-03 15:22:24,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:24,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:24,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:24,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 15:22:26,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:26,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:26,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:26,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:26,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:26,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:26,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:26,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:26,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:26,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:26,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 15:22:26,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24300 backedges. 0 proven. 23200 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-12-03 15:22:27,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:27,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 15:22:27,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:27,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:22:27,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:22:27,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:22:27,241 INFO L87 Difference]: Start difference. First operand 244 states and 264 transitions. Second operand 23 states. [2018-12-03 15:22:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:27,393 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-12-03 15:22:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:22:27,393 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 243 [2018-12-03 15:22:27,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:27,395 INFO L225 Difference]: With dead ends: 269 [2018-12-03 15:22:27,395 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 15:22:27,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:22:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 15:22:27,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 256. [2018-12-03 15:22:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-03 15:22:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 277 transitions. [2018-12-03 15:22:27,459 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 277 transitions. Word has length 243 [2018-12-03 15:22:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:27,459 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 277 transitions. [2018-12-03 15:22:27,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:22:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 277 transitions. [2018-12-03 15:22:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-03 15:22:27,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:27,461 INFO L402 BasicCegarLoop]: trace histogram [210, 21, 21, 1, 1, 1] [2018-12-03 15:22:27,461 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:27,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1238413333, now seen corresponding path program 25 times [2018-12-03 15:22:27,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:27,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:27,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 15:22:28,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:28,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:28,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:28,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:28,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:28,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:28,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:28,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:28,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 15:22:28,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 25641 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-12-03 15:22:29,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:29,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:22:29,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:29,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:22:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:22:29,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:22:29,033 INFO L87 Difference]: Start difference. First operand 256 states and 277 transitions. Second operand 24 states. [2018-12-03 15:22:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:29,259 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-12-03 15:22:29,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:22:29,259 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 255 [2018-12-03 15:22:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:29,260 INFO L225 Difference]: With dead ends: 281 [2018-12-03 15:22:29,260 INFO L226 Difference]: Without dead ends: 279 [2018-12-03 15:22:29,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 487 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 15:22:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-03 15:22:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 268. [2018-12-03 15:22:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-03 15:22:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 290 transitions. [2018-12-03 15:22:29,328 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 290 transitions. Word has length 255 [2018-12-03 15:22:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:29,328 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 290 transitions. [2018-12-03 15:22:29,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:22:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 290 transitions. [2018-12-03 15:22:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-03 15:22:29,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:29,330 INFO L402 BasicCegarLoop]: trace histogram [220, 22, 22, 1, 1, 1] [2018-12-03 15:22:29,330 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:29,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:29,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1994949537, now seen corresponding path program 26 times [2018-12-03 15:22:29,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:29,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:29,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 15:22:29,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:29,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:29,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:29,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:29,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:29,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:29,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:29,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:30,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 133 check-sat command(s) [2018-12-03 15:22:30,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:30,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 15:22:30,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 29414 backedges. 0 proven. 28204 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2018-12-03 15:22:31,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:31,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:22:31,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:31,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:22:31,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:22:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:22:31,866 INFO L87 Difference]: Start difference. First operand 268 states and 290 transitions. Second operand 25 states. [2018-12-03 15:22:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:32,053 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-12-03 15:22:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:22:32,053 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 267 [2018-12-03 15:22:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:32,054 INFO L225 Difference]: With dead ends: 293 [2018-12-03 15:22:32,055 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 15:22:32,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:22:32,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 15:22:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 280. [2018-12-03 15:22:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 15:22:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 303 transitions. [2018-12-03 15:22:32,133 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 303 transitions. Word has length 267 [2018-12-03 15:22:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:32,134 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 303 transitions. [2018-12-03 15:22:32,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:22:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 303 transitions. [2018-12-03 15:22:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-03 15:22:32,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:32,135 INFO L402 BasicCegarLoop]: trace histogram [230, 23, 23, 1, 1, 1] [2018-12-03 15:22:32,135 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:32,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:32,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1785473449, now seen corresponding path program 27 times [2018-12-03 15:22:32,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:32,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:32,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:32,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:32,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 15:22:33,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:33,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:33,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:33,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:33,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:33,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:33,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:33,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:33,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:33,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:33,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 15:22:33,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32154 backedges. 0 proven. 30889 refuted. 0 times theorem prover too weak. 1265 trivial. 0 not checked. [2018-12-03 15:22:34,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:34,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:22:34,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:34,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:22:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:22:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:22:34,905 INFO L87 Difference]: Start difference. First operand 280 states and 303 transitions. Second operand 26 states. [2018-12-03 15:22:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:35,102 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-12-03 15:22:35,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:22:35,103 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 279 [2018-12-03 15:22:35,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:35,104 INFO L225 Difference]: With dead ends: 305 [2018-12-03 15:22:35,105 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 15:22:35,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:22:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 15:22:35,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 292. [2018-12-03 15:22:35,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-03 15:22:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 316 transitions. [2018-12-03 15:22:35,188 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 316 transitions. Word has length 279 [2018-12-03 15:22:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:35,188 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 316 transitions. [2018-12-03 15:22:35,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:22:35,189 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 316 transitions. [2018-12-03 15:22:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-03 15:22:35,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:35,190 INFO L402 BasicCegarLoop]: trace histogram [240, 24, 24, 1, 1, 1] [2018-12-03 15:22:35,190 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:35,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1795504115, now seen corresponding path program 28 times [2018-12-03 15:22:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:35,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:35,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 15:22:36,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:36,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:36,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:36,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:36,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:36,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:36,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:36,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:36,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 15:22:36,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 35016 backedges. 0 proven. 33696 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-12-03 15:22:37,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:37,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:22:37,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:37,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:22:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:22:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:37,683 INFO L87 Difference]: Start difference. First operand 292 states and 316 transitions. Second operand 27 states. [2018-12-03 15:22:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:37,886 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-12-03 15:22:37,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:22:37,886 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 291 [2018-12-03 15:22:37,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:37,888 INFO L225 Difference]: With dead ends: 317 [2018-12-03 15:22:37,888 INFO L226 Difference]: Without dead ends: 315 [2018-12-03 15:22:37,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:37,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-03 15:22:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 304. [2018-12-03 15:22:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-03 15:22:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 329 transitions. [2018-12-03 15:22:38,046 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 329 transitions. Word has length 291 [2018-12-03 15:22:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:38,046 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 329 transitions. [2018-12-03 15:22:38,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:22:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 329 transitions. [2018-12-03 15:22:38,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-03 15:22:38,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:38,049 INFO L402 BasicCegarLoop]: trace histogram [250, 25, 25, 1, 1, 1] [2018-12-03 15:22:38,049 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:38,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1784227645, now seen corresponding path program 29 times [2018-12-03 15:22:38,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:38,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:38,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:38,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 15:22:39,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:39,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:39,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:39,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:39,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:39,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:39,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:39,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:39,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 146 check-sat command(s) [2018-12-03 15:22:39,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:39,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 15:22:39,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 36625 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2018-12-03 15:22:40,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:40,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:22:40,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:40,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:22:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:22:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:22:40,893 INFO L87 Difference]: Start difference. First operand 304 states and 329 transitions. Second operand 28 states. [2018-12-03 15:22:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:41,117 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-12-03 15:22:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:22:41,117 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 303 [2018-12-03 15:22:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:41,118 INFO L225 Difference]: With dead ends: 329 [2018-12-03 15:22:41,118 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 15:22:41,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:22:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 15:22:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2018-12-03 15:22:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-03 15:22:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-12-03 15:22:41,226 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 303 [2018-12-03 15:22:41,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:41,226 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-12-03 15:22:41,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:22:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-12-03 15:22:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-12-03 15:22:41,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:41,228 INFO L402 BasicCegarLoop]: trace histogram [260, 26, 26, 1, 1, 1] [2018-12-03 15:22:41,228 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:41,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1243510663, now seen corresponding path program 30 times [2018-12-03 15:22:41,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:41,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:41,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:41,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:41,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 15:22:42,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:42,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:42,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:42,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:42,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:42,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:42,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:42,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:42,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:42,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:42,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:42,339 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 15:22:42,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 41106 backedges. 0 proven. 39676 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-12-03 15:22:43,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:43,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 15:22:43,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:43,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:22:43,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:22:43,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:22:43,483 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 29 states. [2018-12-03 15:22:43,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:43,707 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-12-03 15:22:43,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:22:43,707 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 315 [2018-12-03 15:22:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:43,709 INFO L225 Difference]: With dead ends: 341 [2018-12-03 15:22:43,709 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 15:22:43,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:22:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 15:22:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 328. [2018-12-03 15:22:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-12-03 15:22:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 355 transitions. [2018-12-03 15:22:43,816 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 355 transitions. Word has length 315 [2018-12-03 15:22:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:43,816 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 355 transitions. [2018-12-03 15:22:43,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:22:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 355 transitions. [2018-12-03 15:22:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-03 15:22:43,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:43,818 INFO L402 BasicCegarLoop]: trace histogram [270, 27, 27, 1, 1, 1] [2018-12-03 15:22:43,818 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:43,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1907644207, now seen corresponding path program 31 times [2018-12-03 15:22:43,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:43,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:43,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:43,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 15:22:45,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:45,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:45,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:45,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 15:22:45,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:45,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:45,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:45,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 15:22:45,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 44334 backedges. 0 proven. 42849 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 15:22:46,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:46,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:22:46,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:46,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:22:46,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:22:46,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:22:46,923 INFO L87 Difference]: Start difference. First operand 328 states and 355 transitions. Second operand 30 states. [2018-12-03 15:22:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:47,252 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-12-03 15:22:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:22:47,252 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 327 [2018-12-03 15:22:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:47,254 INFO L225 Difference]: With dead ends: 353 [2018-12-03 15:22:47,254 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 15:22:47,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:22:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 15:22:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 340. [2018-12-03 15:22:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-03 15:22:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 368 transitions. [2018-12-03 15:22:47,358 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 368 transitions. Word has length 327 [2018-12-03 15:22:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:47,359 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 368 transitions. [2018-12-03 15:22:47,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:22:47,359 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 368 transitions. [2018-12-03 15:22:47,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-12-03 15:22:47,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:47,360 INFO L402 BasicCegarLoop]: trace histogram [280, 28, 28, 1, 1, 1] [2018-12-03 15:22:47,361 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:47,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash -48809189, now seen corresponding path program 32 times [2018-12-03 15:22:47,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:47,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:47,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:47,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 15:22:48,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:48,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:48,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:48,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:48,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:48,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:48,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:48,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:48,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 169 check-sat command(s) [2018-12-03 15:22:48,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:48,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:48,905 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 15:22:48,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 47684 backedges. 0 proven. 46144 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 15:22:49,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:49,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 15:22:49,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:49,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:22:49,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:22:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:22:49,940 INFO L87 Difference]: Start difference. First operand 340 states and 368 transitions. Second operand 31 states. [2018-12-03 15:22:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:50,173 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-12-03 15:22:50,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:22:50,173 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 339 [2018-12-03 15:22:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:50,175 INFO L225 Difference]: With dead ends: 365 [2018-12-03 15:22:50,175 INFO L226 Difference]: Without dead ends: 363 [2018-12-03 15:22:50,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:22:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-03 15:22:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2018-12-03 15:22:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-03 15:22:50,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 381 transitions. [2018-12-03 15:22:50,306 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 381 transitions. Word has length 339 [2018-12-03 15:22:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:50,306 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 381 transitions. [2018-12-03 15:22:50,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:22:50,307 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 381 transitions. [2018-12-03 15:22:50,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-12-03 15:22:50,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:50,309 INFO L402 BasicCegarLoop]: trace histogram [290, 29, 29, 1, 1, 1] [2018-12-03 15:22:50,309 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:50,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1056419429, now seen corresponding path program 33 times [2018-12-03 15:22:50,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:50,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:50,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 15:22:51,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:51,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:51,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:51,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:51,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:51,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:51,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:51,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:51,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:51,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:51,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 15:22:51,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 51156 backedges. 0 proven. 49561 refuted. 0 times theorem prover too weak. 1595 trivial. 0 not checked. [2018-12-03 15:22:52,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:52,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:22:52,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:52,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:22:52,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:22:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:22:52,778 INFO L87 Difference]: Start difference. First operand 352 states and 381 transitions. Second operand 32 states. [2018-12-03 15:22:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:53,010 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-12-03 15:22:53,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:22:53,010 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 351 [2018-12-03 15:22:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:53,011 INFO L225 Difference]: With dead ends: 377 [2018-12-03 15:22:53,011 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 15:22:53,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:22:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 15:22:53,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 364. [2018-12-03 15:22:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-03 15:22:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-12-03 15:22:53,162 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 351 [2018-12-03 15:22:53,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:53,163 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-12-03 15:22:53,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:22:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-12-03 15:22:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-12-03 15:22:53,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:53,165 INFO L402 BasicCegarLoop]: trace histogram [300, 30, 30, 1, 1, 1] [2018-12-03 15:22:53,165 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:53,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash 2124645039, now seen corresponding path program 34 times [2018-12-03 15:22:53,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:53,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:53,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 15:22:53,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:53,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:53,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 15:22:53,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:53,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:53,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:54,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 15:22:54,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 54750 backedges. 0 proven. 53100 refuted. 0 times theorem prover too weak. 1650 trivial. 0 not checked. [2018-12-03 15:22:55,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:55,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 15:22:55,558 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:55,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:22:55,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:22:55,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:22:55,560 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 33 states. [2018-12-03 15:22:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:55,850 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-12-03 15:22:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:22:55,850 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 363 [2018-12-03 15:22:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:55,852 INFO L225 Difference]: With dead ends: 389 [2018-12-03 15:22:55,852 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 15:22:55,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:22:55,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 15:22:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 376. [2018-12-03 15:22:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-03 15:22:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 407 transitions. [2018-12-03 15:22:55,974 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 407 transitions. Word has length 363 [2018-12-03 15:22:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:55,975 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 407 transitions. [2018-12-03 15:22:55,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:22:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 407 transitions. [2018-12-03 15:22:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-12-03 15:22:55,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:55,977 INFO L402 BasicCegarLoop]: trace histogram [310, 31, 31, 1, 1, 1] [2018-12-03 15:22:55,978 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:55,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash 152123385, now seen corresponding path program 35 times [2018-12-03 15:22:55,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:55,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:55,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:55,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:55,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 15:22:56,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:56,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:56,907 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:56,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:56,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:56,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:56,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:56,916 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:57,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 182 check-sat command(s) [2018-12-03 15:22:57,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:57,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 15:22:57,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 58466 backedges. 0 proven. 56761 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2018-12-03 15:22:58,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:58,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:22:58,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:58,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:22:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:22:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:22:58,818 INFO L87 Difference]: Start difference. First operand 376 states and 407 transitions. Second operand 34 states. [2018-12-03 15:22:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:59,160 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-12-03 15:22:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:22:59,160 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 375 [2018-12-03 15:22:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:59,162 INFO L225 Difference]: With dead ends: 401 [2018-12-03 15:22:59,162 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 15:22:59,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:22:59,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 15:22:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2018-12-03 15:22:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-12-03 15:22:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 420 transitions. [2018-12-03 15:22:59,302 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 420 transitions. Word has length 375 [2018-12-03 15:22:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:59,303 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 420 transitions. [2018-12-03 15:22:59,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:22:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 420 transitions. [2018-12-03 15:22:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-12-03 15:22:59,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:59,305 INFO L402 BasicCegarLoop]: trace histogram [320, 32, 32, 1, 1, 1] [2018-12-03 15:22:59,305 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:59,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash -310948285, now seen corresponding path program 36 times [2018-12-03 15:22:59,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:59,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:59,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:00,241 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 15:23:00,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:00,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:00,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:00,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:00,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:00,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:00,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:00,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:00,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:00,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:00,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 15:23:00,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 62304 backedges. 0 proven. 60544 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-12-03 15:23:02,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:02,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 15:23:02,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:02,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:23:02,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:23:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:23:02,225 INFO L87 Difference]: Start difference. First operand 388 states and 420 transitions. Second operand 35 states. [2018-12-03 15:23:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:02,533 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-12-03 15:23:02,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:23:02,533 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 387 [2018-12-03 15:23:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:02,535 INFO L225 Difference]: With dead ends: 413 [2018-12-03 15:23:02,535 INFO L226 Difference]: Without dead ends: 411 [2018-12-03 15:23:02,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 740 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:23:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-03 15:23:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 400. [2018-12-03 15:23:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-03 15:23:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 433 transitions. [2018-12-03 15:23:02,680 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 433 transitions. Word has length 387 [2018-12-03 15:23:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:02,680 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 433 transitions. [2018-12-03 15:23:02,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:23:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 433 transitions. [2018-12-03 15:23:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-12-03 15:23:02,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:02,683 INFO L402 BasicCegarLoop]: trace histogram [330, 33, 33, 1, 1, 1] [2018-12-03 15:23:02,683 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:02,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1655945843, now seen corresponding path program 37 times [2018-12-03 15:23:02,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:02,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 15:23:03,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:03,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:03,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:03,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:03,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:03,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:03,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:03,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 15:23:03,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 66264 backedges. 0 proven. 64449 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2018-12-03 15:23:05,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:05,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 15:23:05,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:05,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:23:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:23:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:23:05,253 INFO L87 Difference]: Start difference. First operand 400 states and 433 transitions. Second operand 36 states. [2018-12-03 15:23:05,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:05,565 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-12-03 15:23:05,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:23:05,565 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 399 [2018-12-03 15:23:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:05,566 INFO L225 Difference]: With dead ends: 425 [2018-12-03 15:23:05,567 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 15:23:05,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:23:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 15:23:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 412. [2018-12-03 15:23:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-12-03 15:23:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 446 transitions. [2018-12-03 15:23:05,719 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 446 transitions. Word has length 399 [2018-12-03 15:23:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:05,719 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 446 transitions. [2018-12-03 15:23:05,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:23:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 446 transitions. [2018-12-03 15:23:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-12-03 15:23:05,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:05,721 INFO L402 BasicCegarLoop]: trace histogram [340, 34, 34, 1, 1, 1] [2018-12-03 15:23:05,722 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:05,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1941529129, now seen corresponding path program 38 times [2018-12-03 15:23:05,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:05,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:05,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:05,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:05,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 15:23:06,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:06,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:06,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:06,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:06,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:06,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:06,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:07,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 205 check-sat command(s) [2018-12-03 15:23:07,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:07,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 15:23:07,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 70346 backedges. 0 proven. 68476 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2018-12-03 15:23:09,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:09,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 15:23:09,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:09,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:23:09,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:23:09,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:23:09,229 INFO L87 Difference]: Start difference. First operand 412 states and 446 transitions. Second operand 37 states. [2018-12-03 15:23:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:09,554 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-12-03 15:23:09,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:23:09,554 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 411 [2018-12-03 15:23:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:09,556 INFO L225 Difference]: With dead ends: 437 [2018-12-03 15:23:09,556 INFO L226 Difference]: Without dead ends: 435 [2018-12-03 15:23:09,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 856 GetRequests, 786 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 15:23:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-03 15:23:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 424. [2018-12-03 15:23:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-03 15:23:09,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2018-12-03 15:23:09,721 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 411 [2018-12-03 15:23:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:09,721 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2018-12-03 15:23:09,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:23:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2018-12-03 15:23:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-12-03 15:23:09,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:09,724 INFO L402 BasicCegarLoop]: trace histogram [350, 35, 35, 1, 1, 1] [2018-12-03 15:23:09,724 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:09,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:09,725 INFO L82 PathProgramCache]: Analyzing trace with hash -799221983, now seen corresponding path program 39 times [2018-12-03 15:23:09,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:09,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:09,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 15:23:10,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:10,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:10,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:10,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:10,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:10,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:10,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:10,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:11,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:11,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:11,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 15:23:11,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 74550 backedges. 0 proven. 72625 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2018-12-03 15:23:13,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:13,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 15:23:13,237 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:13,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:23:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:23:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:23:13,238 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand 38 states. [2018-12-03 15:23:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:13,581 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-12-03 15:23:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:23:13,582 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 423 [2018-12-03 15:23:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:13,583 INFO L225 Difference]: With dead ends: 449 [2018-12-03 15:23:13,583 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 15:23:13,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 809 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:23:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 15:23:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 436. [2018-12-03 15:23:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-12-03 15:23:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 472 transitions. [2018-12-03 15:23:13,743 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 472 transitions. Word has length 423 [2018-12-03 15:23:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:13,743 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 472 transitions. [2018-12-03 15:23:13,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:23:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 472 transitions. [2018-12-03 15:23:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-12-03 15:23:13,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:13,746 INFO L402 BasicCegarLoop]: trace histogram [360, 36, 36, 1, 1, 1] [2018-12-03 15:23:13,746 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:13,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1044024981, now seen corresponding path program 40 times [2018-12-03 15:23:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:13,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:13,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:13,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 15:23:14,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:14,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:14,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:14,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:14,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:14,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:14,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:14,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:14,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 15:23:15,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 78876 backedges. 0 proven. 76896 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-12-03 15:23:16,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:16,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 15:23:16,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:16,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:23:16,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:23:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:23:16,828 INFO L87 Difference]: Start difference. First operand 436 states and 472 transitions. Second operand 39 states. [2018-12-03 15:23:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:17,204 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-12-03 15:23:17,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:23:17,204 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 435 [2018-12-03 15:23:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:17,205 INFO L225 Difference]: With dead ends: 461 [2018-12-03 15:23:17,206 INFO L226 Difference]: Without dead ends: 459 [2018-12-03 15:23:17,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 832 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:23:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-12-03 15:23:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2018-12-03 15:23:17,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-12-03 15:23:17,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 485 transitions. [2018-12-03 15:23:17,381 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 485 transitions. Word has length 435 [2018-12-03 15:23:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:17,382 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 485 transitions. [2018-12-03 15:23:17,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:23:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 485 transitions. [2018-12-03 15:23:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-12-03 15:23:17,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:17,384 INFO L402 BasicCegarLoop]: trace histogram [370, 37, 37, 1, 1, 1] [2018-12-03 15:23:17,384 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:17,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1695093579, now seen corresponding path program 41 times [2018-12-03 15:23:17,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:17,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:17,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:17,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:17,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 15:23:18,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:18,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:18,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:18,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 15:23:18,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:18,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 15:23:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:18,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:19,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 218 check-sat command(s) [2018-12-03 15:23:19,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:19,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 15:23:19,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 83324 backedges. 0 proven. 81289 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [2018-12-03 15:23:21,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:21,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 15:23:21,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:21,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:23:21,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:23:21,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:23:21,493 INFO L87 Difference]: Start difference. First operand 448 states and 485 transitions. Second operand 40 states. [2018-12-03 15:23:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:21,890 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-12-03 15:23:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:23:21,891 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 447 [2018-12-03 15:23:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:21,892 INFO L225 Difference]: With dead ends: 473 [2018-12-03 15:23:21,893 INFO L226 Difference]: Without dead ends: 471 [2018-12-03 15:23:21,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:23:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-03 15:23:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 460. [2018-12-03 15:23:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-12-03 15:23:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 498 transitions. [2018-12-03 15:23:22,080 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 498 transitions. Word has length 447 [2018-12-03 15:23:22,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:22,081 INFO L480 AbstractCegarLoop]: Abstraction has 460 states and 498 transitions. [2018-12-03 15:23:22,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:23:22,081 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 498 transitions. [2018-12-03 15:23:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-12-03 15:23:22,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:22,083 INFO L402 BasicCegarLoop]: trace histogram [380, 38, 38, 1, 1, 1] [2018-12-03 15:23:22,084 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:22,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 413649151, now seen corresponding path program 42 times [2018-12-03 15:23:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:22,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:22,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:22,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 15:23:23,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:23,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:23,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:23,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:23,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:23,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:23,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:23,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:23,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:23,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:23,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 15:23:23,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 87894 backedges. 0 proven. 85804 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-12-03 15:23:25,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:25,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 15:23:25,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:25,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:23:25,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:23:25,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:23:25,315 INFO L87 Difference]: Start difference. First operand 460 states and 498 transitions. Second operand 41 states. [2018-12-03 15:23:25,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:25,698 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-12-03 15:23:25,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:23:25,699 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 459 [2018-12-03 15:23:25,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:25,700 INFO L225 Difference]: With dead ends: 485 [2018-12-03 15:23:25,701 INFO L226 Difference]: Without dead ends: 483 [2018-12-03 15:23:25,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 956 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:23:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-03 15:23:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 472. [2018-12-03 15:23:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-12-03 15:23:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 511 transitions. [2018-12-03 15:23:25,883 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 511 transitions. Word has length 459 [2018-12-03 15:23:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:25,884 INFO L480 AbstractCegarLoop]: Abstraction has 472 states and 511 transitions. [2018-12-03 15:23:25,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:23:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 511 transitions. [2018-12-03 15:23:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-12-03 15:23:25,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:25,886 INFO L402 BasicCegarLoop]: trace histogram [390, 39, 39, 1, 1, 1] [2018-12-03 15:23:25,886 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:25,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:25,886 INFO L82 PathProgramCache]: Analyzing trace with hash 432965193, now seen corresponding path program 43 times [2018-12-03 15:23:25,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:25,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:25,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:25,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 15:23:26,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:26,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:26,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:26,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:26,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:26,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:26,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:26,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:27,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 15:23:27,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 92586 backedges. 0 proven. 90441 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 15:23:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 15:23:29,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:29,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:23:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:23:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:23:29,513 INFO L87 Difference]: Start difference. First operand 472 states and 511 transitions. Second operand 42 states. [2018-12-03 15:23:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:30,079 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-12-03 15:23:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:23:30,080 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 471 [2018-12-03 15:23:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:30,081 INFO L225 Difference]: With dead ends: 497 [2018-12-03 15:23:30,082 INFO L226 Difference]: Without dead ends: 495 [2018-12-03 15:23:30,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:23:30,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-12-03 15:23:30,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 484. [2018-12-03 15:23:30,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-12-03 15:23:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 524 transitions. [2018-12-03 15:23:30,302 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 524 transitions. Word has length 471 [2018-12-03 15:23:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:30,302 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 524 transitions. [2018-12-03 15:23:30,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:23:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 524 transitions. [2018-12-03 15:23:30,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2018-12-03 15:23:30,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:30,304 INFO L402 BasicCegarLoop]: trace histogram [400, 40, 40, 1, 1, 1] [2018-12-03 15:23:30,305 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:30,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:30,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1067558035, now seen corresponding path program 44 times [2018-12-03 15:23:30,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:30,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:30,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:30,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:30,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:31,415 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 15:23:31,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:31,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:31,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:31,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:31,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:31,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:31,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:32,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 241 check-sat command(s) [2018-12-03 15:23:32,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:32,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 15:23:32,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 97400 backedges. 0 proven. 95200 refuted. 0 times theorem prover too weak. 2200 trivial. 0 not checked. [2018-12-03 15:23:34,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:34,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 15:23:34,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:34,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:23:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:23:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:23:34,504 INFO L87 Difference]: Start difference. First operand 484 states and 524 transitions. Second operand 43 states. [2018-12-03 15:23:34,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:34,939 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-12-03 15:23:34,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:23:34,940 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 483 [2018-12-03 15:23:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:34,942 INFO L225 Difference]: With dead ends: 509 [2018-12-03 15:23:34,942 INFO L226 Difference]: Without dead ends: 507 [2018-12-03 15:23:34,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:23:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-12-03 15:23:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 496. [2018-12-03 15:23:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-03 15:23:35,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 537 transitions. [2018-12-03 15:23:35,142 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 537 transitions. Word has length 483 [2018-12-03 15:23:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:35,143 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 537 transitions. [2018-12-03 15:23:35,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:23:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 537 transitions. [2018-12-03 15:23:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-12-03 15:23:35,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:35,145 INFO L402 BasicCegarLoop]: trace histogram [410, 41, 41, 1, 1, 1] [2018-12-03 15:23:35,145 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:35,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1919441955, now seen corresponding path program 45 times [2018-12-03 15:23:35,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:35,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:35,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:35,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 15:23:36,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:36,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:36,084 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:36,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:36,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:36,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:36,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:36,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:36,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:36,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:36,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 15:23:36,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 102336 backedges. 0 proven. 100081 refuted. 0 times theorem prover too weak. 2255 trivial. 0 not checked. [2018-12-03 15:23:38,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:38,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 15:23:38,708 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:38,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:23:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:23:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:23:38,710 INFO L87 Difference]: Start difference. First operand 496 states and 537 transitions. Second operand 44 states. [2018-12-03 15:23:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:39,147 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-12-03 15:23:39,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:23:39,148 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 495 [2018-12-03 15:23:39,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:39,150 INFO L225 Difference]: With dead ends: 521 [2018-12-03 15:23:39,150 INFO L226 Difference]: Without dead ends: 519 [2018-12-03 15:23:39,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1031 GetRequests, 947 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:23:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-12-03 15:23:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2018-12-03 15:23:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-12-03 15:23:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 550 transitions. [2018-12-03 15:23:39,413 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 550 transitions. Word has length 495 [2018-12-03 15:23:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:39,413 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 550 transitions. [2018-12-03 15:23:39,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:23:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 550 transitions. [2018-12-03 15:23:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2018-12-03 15:23:39,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:39,417 INFO L402 BasicCegarLoop]: trace histogram [420, 42, 42, 1, 1, 1] [2018-12-03 15:23:39,417 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:39,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:39,417 INFO L82 PathProgramCache]: Analyzing trace with hash 157746215, now seen corresponding path program 46 times [2018-12-03 15:23:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:39,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:39,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:39,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 15:23:40,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:40,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:40,569 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:40,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 15:23:40,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:40,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:40,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:40,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:41,072 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 15:23:41,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 107394 backedges. 0 proven. 105084 refuted. 0 times theorem prover too weak. 2310 trivial. 0 not checked. [2018-12-03 15:23:43,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:43,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 15:23:43,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:43,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:23:43,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:23:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:23:43,549 INFO L87 Difference]: Start difference. First operand 508 states and 550 transitions. Second operand 45 states. [2018-12-03 15:23:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:44,556 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-12-03 15:23:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:23:44,556 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 507 [2018-12-03 15:23:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:44,559 INFO L225 Difference]: With dead ends: 533 [2018-12-03 15:23:44,559 INFO L226 Difference]: Without dead ends: 531 [2018-12-03 15:23:44,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 970 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:23:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-12-03 15:23:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 520. [2018-12-03 15:23:44,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-03 15:23:44,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 563 transitions. [2018-12-03 15:23:44,853 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 563 transitions. Word has length 507 [2018-12-03 15:23:44,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:44,854 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 563 transitions. [2018-12-03 15:23:44,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:23:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 563 transitions. [2018-12-03 15:23:44,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-12-03 15:23:44,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:44,856 INFO L402 BasicCegarLoop]: trace histogram [430, 43, 43, 1, 1, 1] [2018-12-03 15:23:44,856 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:44,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1527137649, now seen corresponding path program 47 times [2018-12-03 15:23:44,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:44,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:44,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:44,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:44,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 15:23:45,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:45,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:45,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:45,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:45,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:45,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:45,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:45,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:46,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 254 check-sat command(s) [2018-12-03 15:23:46,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:46,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:47,068 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 15:23:47,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 112574 backedges. 0 proven. 110209 refuted. 0 times theorem prover too weak. 2365 trivial. 0 not checked. [2018-12-03 15:23:49,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:49,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 15:23:49,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:49,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:23:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:23:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:23:49,637 INFO L87 Difference]: Start difference. First operand 520 states and 563 transitions. Second operand 46 states. [2018-12-03 15:23:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:50,256 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-12-03 15:23:50,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:23:50,257 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 519 [2018-12-03 15:23:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:50,259 INFO L225 Difference]: With dead ends: 545 [2018-12-03 15:23:50,260 INFO L226 Difference]: Without dead ends: 543 [2018-12-03 15:23:50,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 993 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:23:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-12-03 15:23:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 532. [2018-12-03 15:23:50,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-12-03 15:23:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 576 transitions. [2018-12-03 15:23:50,578 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 576 transitions. Word has length 519 [2018-12-03 15:23:50,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:50,578 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 576 transitions. [2018-12-03 15:23:50,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:23:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 576 transitions. [2018-12-03 15:23:50,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-12-03 15:23:50,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:50,581 INFO L402 BasicCegarLoop]: trace histogram [440, 44, 44, 1, 1, 1] [2018-12-03 15:23:50,581 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:50,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:50,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1823205307, now seen corresponding path program 48 times [2018-12-03 15:23:50,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:50,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:50,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:50,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:50,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:51,700 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 15:23:51,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:51,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:51,701 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:51,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:51,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:51,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:51,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:51,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:52,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:52,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:52,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 15:23:52,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 117876 backedges. 0 proven. 115456 refuted. 0 times theorem prover too weak. 2420 trivial. 0 not checked. [2018-12-03 15:23:54,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:54,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 15:23:54,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:54,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:23:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:23:54,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:23:54,913 INFO L87 Difference]: Start difference. First operand 532 states and 576 transitions. Second operand 47 states. [2018-12-03 15:23:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:55,509 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-12-03 15:23:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:23:55,509 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 531 [2018-12-03 15:23:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:55,511 INFO L225 Difference]: With dead ends: 557 [2018-12-03 15:23:55,511 INFO L226 Difference]: Without dead ends: 555 [2018-12-03 15:23:55,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:23:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-12-03 15:23:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 544. [2018-12-03 15:23:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-12-03 15:23:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 589 transitions. [2018-12-03 15:23:55,801 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 589 transitions. Word has length 531 [2018-12-03 15:23:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:55,801 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 589 transitions. [2018-12-03 15:23:55,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:23:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 589 transitions. [2018-12-03 15:23:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-12-03 15:23:55,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:55,804 INFO L402 BasicCegarLoop]: trace histogram [450, 45, 45, 1, 1, 1] [2018-12-03 15:23:55,804 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:55,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:55,804 INFO L82 PathProgramCache]: Analyzing trace with hash 181299973, now seen corresponding path program 49 times [2018-12-03 15:23:55,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:55,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:55,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:55,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 15:23:56,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:56,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:56,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:56,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:56,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:56,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:57,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 15:23:57,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 123300 backedges. 0 proven. 120825 refuted. 0 times theorem prover too weak. 2475 trivial. 0 not checked. [2018-12-03 15:24:00,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:00,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 15:24:00,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:00,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:24:00,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:24:00,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:24:00,179 INFO L87 Difference]: Start difference. First operand 544 states and 589 transitions. Second operand 48 states. [2018-12-03 15:24:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:00,751 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-12-03 15:24:00,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:24:00,752 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 543 [2018-12-03 15:24:00,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:00,754 INFO L225 Difference]: With dead ends: 569 [2018-12-03 15:24:00,754 INFO L226 Difference]: Without dead ends: 567 [2018-12-03 15:24:00,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1039 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 15:24:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-12-03 15:24:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 556. [2018-12-03 15:24:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-12-03 15:24:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 602 transitions. [2018-12-03 15:24:01,044 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 602 transitions. Word has length 543 [2018-12-03 15:24:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:01,045 INFO L480 AbstractCegarLoop]: Abstraction has 556 states and 602 transitions. [2018-12-03 15:24:01,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:24:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 602 transitions. [2018-12-03 15:24:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2018-12-03 15:24:01,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:01,049 INFO L402 BasicCegarLoop]: trace histogram [460, 46, 46, 1, 1, 1] [2018-12-03 15:24:01,049 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:01,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:01,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2077995185, now seen corresponding path program 50 times [2018-12-03 15:24:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:01,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 15:24:02,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:02,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:02,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:02,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:02,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:02,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:02,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:03,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 277 check-sat command(s) [2018-12-03 15:24:03,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:03,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 15:24:03,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 128846 backedges. 0 proven. 126316 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2018-12-03 15:24:06,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:06,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 15:24:06,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:06,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:24:06,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:24:06,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:24:06,177 INFO L87 Difference]: Start difference. First operand 556 states and 602 transitions. Second operand 49 states. [2018-12-03 15:24:06,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:06,724 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-12-03 15:24:06,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:24:06,725 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 555 [2018-12-03 15:24:06,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:06,727 INFO L225 Difference]: With dead ends: 581 [2018-12-03 15:24:06,727 INFO L226 Difference]: Without dead ends: 579 [2018-12-03 15:24:06,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:24:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-12-03 15:24:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 568. [2018-12-03 15:24:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-03 15:24:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 615 transitions. [2018-12-03 15:24:07,028 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 615 transitions. Word has length 555 [2018-12-03 15:24:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:07,028 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 615 transitions. [2018-12-03 15:24:07,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:24:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 615 transitions. [2018-12-03 15:24:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-12-03 15:24:07,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:07,031 INFO L402 BasicCegarLoop]: trace histogram [470, 47, 47, 1, 1, 1] [2018-12-03 15:24:07,031 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:07,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1235489945, now seen corresponding path program 51 times [2018-12-03 15:24:07,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:07,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:07,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:07,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:07,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 15:24:08,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:08,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:08,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:08,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:08,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:08,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:08,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:08,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:08,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:08,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:08,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 15:24:09,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 134514 backedges. 0 proven. 131929 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2018-12-03 15:24:11,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:11,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 15:24:11,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:11,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:24:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:24:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:24:11,694 INFO L87 Difference]: Start difference. First operand 568 states and 615 transitions. Second operand 50 states. [2018-12-03 15:24:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:12,276 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-12-03 15:24:12,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:24:12,278 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 567 [2018-12-03 15:24:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:12,280 INFO L225 Difference]: With dead ends: 593 [2018-12-03 15:24:12,280 INFO L226 Difference]: Without dead ends: 591 [2018-12-03 15:24:12,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1181 GetRequests, 1085 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 15:24:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-12-03 15:24:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 580. [2018-12-03 15:24:12,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-12-03 15:24:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 628 transitions. [2018-12-03 15:24:12,598 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 628 transitions. Word has length 567 [2018-12-03 15:24:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:12,598 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 628 transitions. [2018-12-03 15:24:12,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:24:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 628 transitions. [2018-12-03 15:24:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-12-03 15:24:12,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:12,601 INFO L402 BasicCegarLoop]: trace histogram [480, 48, 48, 1, 1, 1] [2018-12-03 15:24:12,601 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:12,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1903936797, now seen corresponding path program 52 times [2018-12-03 15:24:12,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:12,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:12,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:12,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:14,093 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 15:24:14,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:14,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:14,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:14,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:14,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:14,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:14,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:14,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:14,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:14,673 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 15:24:14,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 140304 backedges. 0 proven. 137664 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-12-03 15:24:17,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:17,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 15:24:17,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:17,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:24:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:24:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:24:17,711 INFO L87 Difference]: Start difference. First operand 580 states and 628 transitions. Second operand 51 states. [2018-12-03 15:24:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:18,267 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-12-03 15:24:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:24:18,268 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 579 [2018-12-03 15:24:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:18,270 INFO L225 Difference]: With dead ends: 605 [2018-12-03 15:24:18,270 INFO L226 Difference]: Without dead ends: 603 [2018-12-03 15:24:18,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1108 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:24:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-12-03 15:24:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2018-12-03 15:24:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-12-03 15:24:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 641 transitions. [2018-12-03 15:24:18,602 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 641 transitions. Word has length 579 [2018-12-03 15:24:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:18,602 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 641 transitions. [2018-12-03 15:24:18,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:24:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 641 transitions. [2018-12-03 15:24:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2018-12-03 15:24:18,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:18,605 INFO L402 BasicCegarLoop]: trace histogram [490, 49, 49, 1, 1, 1] [2018-12-03 15:24:18,605 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:18,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:18,606 INFO L82 PathProgramCache]: Analyzing trace with hash -398769619, now seen corresponding path program 53 times [2018-12-03 15:24:18,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:18,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:18,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:18,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 15:24:19,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:19,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:19,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:19,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:19,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:19,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:19,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:21,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 290 check-sat command(s) [2018-12-03 15:24:21,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:21,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 15:24:21,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 146216 backedges. 0 proven. 143521 refuted. 0 times theorem prover too weak. 2695 trivial. 0 not checked. [2018-12-03 15:24:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:24,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 15:24:24,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:24,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:24:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:24:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:24:24,564 INFO L87 Difference]: Start difference. First operand 592 states and 641 transitions. Second operand 52 states. [2018-12-03 15:24:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:25,233 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-12-03 15:24:25,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:24:25,233 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 591 [2018-12-03 15:24:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:25,235 INFO L225 Difference]: With dead ends: 617 [2018-12-03 15:24:25,235 INFO L226 Difference]: Without dead ends: 615 [2018-12-03 15:24:25,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1231 GetRequests, 1131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:24:25,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-12-03 15:24:25,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 604. [2018-12-03 15:24:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-03 15:24:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 654 transitions. [2018-12-03 15:24:25,549 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 654 transitions. Word has length 591 [2018-12-03 15:24:25,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:25,549 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 654 transitions. [2018-12-03 15:24:25,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:24:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 654 transitions. [2018-12-03 15:24:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-12-03 15:24:25,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:25,552 INFO L402 BasicCegarLoop]: trace histogram [500, 50, 50, 1, 1, 1] [2018-12-03 15:24:25,552 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:25,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:25,553 INFO L82 PathProgramCache]: Analyzing trace with hash -293623177, now seen corresponding path program 54 times [2018-12-03 15:24:25,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:25,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:25,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:25,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 15:24:26,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:26,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:26,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:26,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:26,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:26,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:26,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:26,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:27,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:27,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:27,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 15:24:27,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 152250 backedges. 0 proven. 149500 refuted. 0 times theorem prover too weak. 2750 trivial. 0 not checked. [2018-12-03 15:24:30,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:30,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 15:24:30,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:30,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:24:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:24:30,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:24:30,771 INFO L87 Difference]: Start difference. First operand 604 states and 654 transitions. Second operand 53 states. [2018-12-03 15:24:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:31,471 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-12-03 15:24:31,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:24:31,471 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 603 [2018-12-03 15:24:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:31,473 INFO L225 Difference]: With dead ends: 629 [2018-12-03 15:24:31,474 INFO L226 Difference]: Without dead ends: 627 [2018-12-03 15:24:31,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1256 GetRequests, 1154 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 15:24:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-12-03 15:24:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 616. [2018-12-03 15:24:31,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-12-03 15:24:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 667 transitions. [2018-12-03 15:24:31,808 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 667 transitions. Word has length 603 [2018-12-03 15:24:31,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:31,809 INFO L480 AbstractCegarLoop]: Abstraction has 616 states and 667 transitions. [2018-12-03 15:24:31,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:24:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 667 transitions. [2018-12-03 15:24:31,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2018-12-03 15:24:31,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:31,812 INFO L402 BasicCegarLoop]: trace histogram [510, 51, 51, 1, 1, 1] [2018-12-03 15:24:31,812 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:31,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:31,812 INFO L82 PathProgramCache]: Analyzing trace with hash -616041535, now seen corresponding path program 55 times [2018-12-03 15:24:31,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:31,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:31,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:31,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 15:24:33,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:33,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:33,264 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:33,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:33,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:33,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:33,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:33,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:33,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 15:24:33,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 158406 backedges. 0 proven. 155601 refuted. 0 times theorem prover too weak. 2805 trivial. 0 not checked. [2018-12-03 15:24:37,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:37,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 15:24:37,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:37,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:24:37,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:24:37,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:24:37,113 INFO L87 Difference]: Start difference. First operand 616 states and 667 transitions. Second operand 54 states. [2018-12-03 15:24:37,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:37,821 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-12-03 15:24:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:24:37,821 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 615 [2018-12-03 15:24:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:37,823 INFO L225 Difference]: With dead ends: 641 [2018-12-03 15:24:37,824 INFO L226 Difference]: Without dead ends: 639 [2018-12-03 15:24:37,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1281 GetRequests, 1177 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:24:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-12-03 15:24:38,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 628. [2018-12-03 15:24:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2018-12-03 15:24:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 680 transitions. [2018-12-03 15:24:38,183 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 680 transitions. Word has length 615 [2018-12-03 15:24:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:38,183 INFO L480 AbstractCegarLoop]: Abstraction has 628 states and 680 transitions. [2018-12-03 15:24:38,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:24:38,183 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 680 transitions. [2018-12-03 15:24:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-12-03 15:24:38,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:38,186 INFO L402 BasicCegarLoop]: trace histogram [520, 52, 52, 1, 1, 1] [2018-12-03 15:24:38,186 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:38,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 717921803, now seen corresponding path program 56 times [2018-12-03 15:24:38,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:38,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:38,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 15:24:39,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:39,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:39,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:39,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:39,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:39,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:39,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:39,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:41,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 313 check-sat command(s) [2018-12-03 15:24:41,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:41,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 15:24:41,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 164684 backedges. 0 proven. 161824 refuted. 0 times theorem prover too weak. 2860 trivial. 0 not checked. [2018-12-03 15:24:45,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:45,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 15:24:45,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:45,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:24:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:24:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:24:45,155 INFO L87 Difference]: Start difference. First operand 628 states and 680 transitions. Second operand 55 states. [2018-12-03 15:24:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:45,895 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-12-03 15:24:45,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:24:45,896 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 627 [2018-12-03 15:24:45,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:45,898 INFO L225 Difference]: With dead ends: 653 [2018-12-03 15:24:45,898 INFO L226 Difference]: Without dead ends: 651 [2018-12-03 15:24:45,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:24:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-12-03 15:24:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 640. [2018-12-03 15:24:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-12-03 15:24:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 693 transitions. [2018-12-03 15:24:46,286 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 693 transitions. Word has length 627 [2018-12-03 15:24:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:46,286 INFO L480 AbstractCegarLoop]: Abstraction has 640 states and 693 transitions. [2018-12-03 15:24:46,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:24:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 693 transitions. [2018-12-03 15:24:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-12-03 15:24:46,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:46,290 INFO L402 BasicCegarLoop]: trace histogram [530, 53, 53, 1, 1, 1] [2018-12-03 15:24:46,290 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:46,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 998123861, now seen corresponding path program 57 times [2018-12-03 15:24:46,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:46,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:46,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:47,702 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 15:24:47,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:47,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:47,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:47,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:47,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:47,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:47,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:47,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:48,086 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:48,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:48,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 15:24:48,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:52,120 INFO L134 CoverageAnalysis]: Checked inductivity of 171084 backedges. 0 proven. 168169 refuted. 0 times theorem prover too weak. 2915 trivial. 0 not checked. [2018-12-03 15:24:52,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:52,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 15:24:52,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:52,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:24:52,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:24:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:24:52,143 INFO L87 Difference]: Start difference. First operand 640 states and 693 transitions. Second operand 56 states. [2018-12-03 15:24:52,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:52,907 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-12-03 15:24:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:24:52,907 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 639 [2018-12-03 15:24:52,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:52,909 INFO L225 Difference]: With dead ends: 665 [2018-12-03 15:24:52,910 INFO L226 Difference]: Without dead ends: 663 [2018-12-03 15:24:52,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1331 GetRequests, 1223 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:24:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-12-03 15:24:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 652. [2018-12-03 15:24:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-12-03 15:24:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 706 transitions. [2018-12-03 15:24:53,291 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 706 transitions. Word has length 639 [2018-12-03 15:24:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:53,292 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 706 transitions. [2018-12-03 15:24:53,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:24:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 706 transitions. [2018-12-03 15:24:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2018-12-03 15:24:53,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:53,295 INFO L402 BasicCegarLoop]: trace histogram [540, 54, 54, 1, 1, 1] [2018-12-03 15:24:53,295 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:53,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:53,295 INFO L82 PathProgramCache]: Analyzing trace with hash -300345953, now seen corresponding path program 58 times [2018-12-03 15:24:53,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:53,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:53,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:53,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:53,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 15:24:55,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:55,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:55,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:55,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:55,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:55,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:55,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:55,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:55,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 15:24:55,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 177606 backedges. 0 proven. 174636 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2018-12-03 15:24:59,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:59,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 15:24:59,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:59,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:24:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:24:59,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:24:59,753 INFO L87 Difference]: Start difference. First operand 652 states and 706 transitions. Second operand 57 states. [2018-12-03 15:25:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:00,571 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-12-03 15:25:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:25:00,572 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 651 [2018-12-03 15:25:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:00,574 INFO L225 Difference]: With dead ends: 677 [2018-12-03 15:25:00,574 INFO L226 Difference]: Without dead ends: 675 [2018-12-03 15:25:00,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 1246 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:25:00,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-12-03 15:25:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 664. [2018-12-03 15:25:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-12-03 15:25:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 719 transitions. [2018-12-03 15:25:01,005 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 719 transitions. Word has length 651 [2018-12-03 15:25:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:01,006 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 719 transitions. [2018-12-03 15:25:01,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:25:01,006 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 719 transitions. [2018-12-03 15:25:01,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2018-12-03 15:25:01,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:01,009 INFO L402 BasicCegarLoop]: trace histogram [550, 55, 55, 1, 1, 1] [2018-12-03 15:25:01,009 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:01,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1167188713, now seen corresponding path program 59 times [2018-12-03 15:25:01,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:01,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:01,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:01,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 15:25:02,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:02,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:02,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:02,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:02,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:02,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:02,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:02,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:04,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 326 check-sat command(s) [2018-12-03 15:25:04,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:04,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 15:25:04,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 184250 backedges. 0 proven. 181225 refuted. 0 times theorem prover too weak. 3025 trivial. 0 not checked. [2018-12-03 15:25:08,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:08,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 15:25:08,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:08,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:25:08,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:25:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:25:08,208 INFO L87 Difference]: Start difference. First operand 664 states and 719 transitions. Second operand 58 states. [2018-12-03 15:25:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:09,040 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-12-03 15:25:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:25:09,040 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 663 [2018-12-03 15:25:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:09,043 INFO L225 Difference]: With dead ends: 689 [2018-12-03 15:25:09,043 INFO L226 Difference]: Without dead ends: 687 [2018-12-03 15:25:09,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1381 GetRequests, 1269 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:25:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-12-03 15:25:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 676. [2018-12-03 15:25:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-12-03 15:25:09,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 732 transitions. [2018-12-03 15:25:09,494 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 732 transitions. Word has length 663 [2018-12-03 15:25:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:09,495 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 732 transitions. [2018-12-03 15:25:09,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:25:09,495 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 732 transitions. [2018-12-03 15:25:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-12-03 15:25:09,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:09,498 INFO L402 BasicCegarLoop]: trace histogram [560, 56, 56, 1, 1, 1] [2018-12-03 15:25:09,498 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:09,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:09,499 INFO L82 PathProgramCache]: Analyzing trace with hash 119476531, now seen corresponding path program 60 times [2018-12-03 15:25:09,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:09,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:09,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:09,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:09,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 15:25:11,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:11,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:11,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:11,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:11,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:11,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:11,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:11,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:11,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:11,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:11,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 15:25:11,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 191016 backedges. 0 proven. 187936 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2018-12-03 15:25:15,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:15,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 15:25:15,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:15,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:25:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:25:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:25:15,888 INFO L87 Difference]: Start difference. First operand 676 states and 732 transitions. Second operand 59 states. [2018-12-03 15:25:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:16,719 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-12-03 15:25:16,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:25:16,720 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 675 [2018-12-03 15:25:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:16,722 INFO L225 Difference]: With dead ends: 701 [2018-12-03 15:25:16,722 INFO L226 Difference]: Without dead ends: 699 [2018-12-03 15:25:16,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1406 GetRequests, 1292 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:25:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-12-03 15:25:17,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 688. [2018-12-03 15:25:17,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-03 15:25:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 745 transitions. [2018-12-03 15:25:17,161 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 745 transitions. Word has length 675 [2018-12-03 15:25:17,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:17,161 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 745 transitions. [2018-12-03 15:25:17,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:25:17,161 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 745 transitions. [2018-12-03 15:25:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2018-12-03 15:25:17,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:17,165 INFO L402 BasicCegarLoop]: trace histogram [570, 57, 57, 1, 1, 1] [2018-12-03 15:25:17,165 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:17,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:17,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1513562237, now seen corresponding path program 61 times [2018-12-03 15:25:17,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:17,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:17,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:17,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:17,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 15:25:18,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:18,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:18,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:18,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:18,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:18,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:18,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:18,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:25:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:19,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 15:25:19,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 197904 backedges. 0 proven. 194769 refuted. 0 times theorem prover too weak. 3135 trivial. 0 not checked. [2018-12-03 15:25:23,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:23,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 15:25:23,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:23,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:25:23,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:25:23,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:25:23,564 INFO L87 Difference]: Start difference. First operand 688 states and 745 transitions. Second operand 60 states. [2018-12-03 15:25:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:24,425 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-12-03 15:25:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:25:24,426 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 687 [2018-12-03 15:25:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:24,428 INFO L225 Difference]: With dead ends: 713 [2018-12-03 15:25:24,428 INFO L226 Difference]: Without dead ends: 711 [2018-12-03 15:25:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1431 GetRequests, 1315 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:25:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-12-03 15:25:24,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 700. [2018-12-03 15:25:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 15:25:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 758 transitions. [2018-12-03 15:25:24,920 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 758 transitions. Word has length 687 [2018-12-03 15:25:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:24,920 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 758 transitions. [2018-12-03 15:25:24,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:25:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 758 transitions. [2018-12-03 15:25:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-12-03 15:25:24,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:24,924 INFO L402 BasicCegarLoop]: trace histogram [580, 58, 58, 1, 1, 1] [2018-12-03 15:25:24,924 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:24,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1754304711, now seen corresponding path program 62 times [2018-12-03 15:25:24,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:24,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:24,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 15:25:26,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:26,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:26,685 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:26,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:26,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:26,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:26,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:26,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:28,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 349 check-sat command(s) [2018-12-03 15:25:28,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:28,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 15:25:28,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 204914 backedges. 0 proven. 201724 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2018-12-03 15:25:33,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:33,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 15:25:33,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:33,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:25:33,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:25:33,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:25:33,213 INFO L87 Difference]: Start difference. First operand 700 states and 758 transitions. Second operand 61 states. [2018-12-03 15:25:34,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:34,060 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-12-03 15:25:34,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:25:34,061 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 699 [2018-12-03 15:25:34,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:34,063 INFO L225 Difference]: With dead ends: 725 [2018-12-03 15:25:34,063 INFO L226 Difference]: Without dead ends: 723 [2018-12-03 15:25:34,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1456 GetRequests, 1338 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:25:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-12-03 15:25:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 712. [2018-12-03 15:25:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-03 15:25:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 771 transitions. [2018-12-03 15:25:34,517 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 771 transitions. Word has length 699 [2018-12-03 15:25:34,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:34,517 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 771 transitions. [2018-12-03 15:25:34,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:25:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 771 transitions. [2018-12-03 15:25:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2018-12-03 15:25:34,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:34,521 INFO L402 BasicCegarLoop]: trace histogram [590, 59, 59, 1, 1, 1] [2018-12-03 15:25:34,522 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:34,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:34,522 INFO L82 PathProgramCache]: Analyzing trace with hash -31333871, now seen corresponding path program 63 times [2018-12-03 15:25:34,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:34,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:34,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 15:25:36,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:36,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:36,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:36,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:36,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:36,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:36,528 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:36,528 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:36,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:36,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:36,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 15:25:37,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 212046 backedges. 0 proven. 208801 refuted. 0 times theorem prover too weak. 3245 trivial. 0 not checked. [2018-12-03 15:25:41,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:41,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 15:25:41,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:41,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:25:41,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:25:41,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:25:41,847 INFO L87 Difference]: Start difference. First operand 712 states and 771 transitions. Second operand 62 states. [2018-12-03 15:25:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:42,783 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-12-03 15:25:42,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:25:42,783 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 711 [2018-12-03 15:25:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:42,786 INFO L225 Difference]: With dead ends: 737 [2018-12-03 15:25:42,786 INFO L226 Difference]: Without dead ends: 735 [2018-12-03 15:25:42,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1481 GetRequests, 1361 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:25:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-12-03 15:25:43,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 724. [2018-12-03 15:25:43,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-12-03 15:25:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 784 transitions. [2018-12-03 15:25:43,314 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 784 transitions. Word has length 711 [2018-12-03 15:25:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:43,315 INFO L480 AbstractCegarLoop]: Abstraction has 724 states and 784 transitions. [2018-12-03 15:25:43,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:25:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 784 transitions. [2018-12-03 15:25:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2018-12-03 15:25:43,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:43,319 INFO L402 BasicCegarLoop]: trace histogram [600, 60, 60, 1, 1, 1] [2018-12-03 15:25:43,319 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:43,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash 690066523, now seen corresponding path program 64 times [2018-12-03 15:25:43,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:43,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:43,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:43,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 15:25:45,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:45,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:45,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:45,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:45,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:45,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:45,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:45,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:25:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:45,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 15:25:45,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 219300 backedges. 0 proven. 216000 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2018-12-03 15:25:50,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:50,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 15:25:50,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:50,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:25:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:25:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:25:50,350 INFO L87 Difference]: Start difference. First operand 724 states and 784 transitions. Second operand 63 states. [2018-12-03 15:25:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:51,289 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-12-03 15:25:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:25:51,289 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 723 [2018-12-03 15:25:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:51,291 INFO L225 Difference]: With dead ends: 749 [2018-12-03 15:25:51,292 INFO L226 Difference]: Without dead ends: 747 [2018-12-03 15:25:51,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1506 GetRequests, 1384 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:25:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-12-03 15:25:51,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 736. [2018-12-03 15:25:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-03 15:25:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 797 transitions. [2018-12-03 15:25:51,821 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 797 transitions. Word has length 723 [2018-12-03 15:25:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:51,821 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 797 transitions. [2018-12-03 15:25:51,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:25:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 797 transitions. [2018-12-03 15:25:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2018-12-03 15:25:51,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:51,825 INFO L402 BasicCegarLoop]: trace histogram [610, 61, 61, 1, 1, 1] [2018-12-03 15:25:51,825 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:51,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash -637130843, now seen corresponding path program 65 times [2018-12-03 15:25:51,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:51,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 15:25:53,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:53,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:53,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:53,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:53,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:53,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:53,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:53,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:55,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 362 check-sat command(s) [2018-12-03 15:25:55,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:55,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:56,051 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 15:25:56,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 226676 backedges. 0 proven. 223321 refuted. 0 times theorem prover too weak. 3355 trivial. 0 not checked. [2018-12-03 15:26:00,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:00,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 15:26:00,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:00,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:26:00,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:26:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:26:00,576 INFO L87 Difference]: Start difference. First operand 736 states and 797 transitions. Second operand 64 states. [2018-12-03 15:26:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:01,869 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-12-03 15:26:01,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:26:01,869 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 735 [2018-12-03 15:26:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:01,871 INFO L225 Difference]: With dead ends: 761 [2018-12-03 15:26:01,872 INFO L226 Difference]: Without dead ends: 759 [2018-12-03 15:26:01,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1531 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:26:01,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-12-03 15:26:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 748. [2018-12-03 15:26:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-12-03 15:26:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 810 transitions. [2018-12-03 15:26:02,431 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 810 transitions. Word has length 735 [2018-12-03 15:26:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:02,431 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 810 transitions. [2018-12-03 15:26:02,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:26:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 810 transitions. [2018-12-03 15:26:02,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-12-03 15:26:02,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:02,436 INFO L402 BasicCegarLoop]: trace histogram [620, 62, 62, 1, 1, 1] [2018-12-03 15:26:02,436 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:02,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:02,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2088363025, now seen corresponding path program 66 times [2018-12-03 15:26:02,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:02,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:02,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:02,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 15:26:04,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:04,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:04,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:04,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:04,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:04,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:04,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:04,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:04,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:04,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:04,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 15:26:05,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 234174 backedges. 0 proven. 230764 refuted. 0 times theorem prover too weak. 3410 trivial. 0 not checked. [2018-12-03 15:26:10,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:10,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 15:26:10,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:10,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:26:10,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:26:10,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:26:10,053 INFO L87 Difference]: Start difference. First operand 748 states and 810 transitions. Second operand 65 states. [2018-12-03 15:26:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:10,967 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-12-03 15:26:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:26:10,968 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 747 [2018-12-03 15:26:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:10,970 INFO L225 Difference]: With dead ends: 773 [2018-12-03 15:26:10,970 INFO L226 Difference]: Without dead ends: 771 [2018-12-03 15:26:10,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1556 GetRequests, 1430 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:26:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-12-03 15:26:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 760. [2018-12-03 15:26:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-12-03 15:26:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 823 transitions. [2018-12-03 15:26:11,542 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 823 transitions. Word has length 747 [2018-12-03 15:26:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:11,543 INFO L480 AbstractCegarLoop]: Abstraction has 760 states and 823 transitions. [2018-12-03 15:26:11,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:26:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 823 transitions. [2018-12-03 15:26:11,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-12-03 15:26:11,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:11,547 INFO L402 BasicCegarLoop]: trace histogram [630, 63, 63, 1, 1, 1] [2018-12-03 15:26:11,547 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:11,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:11,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1164447431, now seen corresponding path program 67 times [2018-12-03 15:26:11,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:11,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:11,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:14,267 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 15:26:14,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:14,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:14,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:14,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:14,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:14,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:14,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:14,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:14,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 15:26:15,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 241794 backedges. 0 proven. 238329 refuted. 0 times theorem prover too weak. 3465 trivial. 0 not checked. [2018-12-03 15:26:20,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:20,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 15:26:20,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:20,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:26:20,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:26:20,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:26:20,238 INFO L87 Difference]: Start difference. First operand 760 states and 823 transitions. Second operand 66 states. [2018-12-03 15:26:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:21,163 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-12-03 15:26:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:26:21,163 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 759 [2018-12-03 15:26:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:21,165 INFO L225 Difference]: With dead ends: 785 [2018-12-03 15:26:21,166 INFO L226 Difference]: Without dead ends: 783 [2018-12-03 15:26:21,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1581 GetRequests, 1453 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:26:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-12-03 15:26:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-12-03 15:26:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-12-03 15:26:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 836 transitions. [2018-12-03 15:26:21,766 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 836 transitions. Word has length 759 [2018-12-03 15:26:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:21,766 INFO L480 AbstractCegarLoop]: Abstraction has 772 states and 836 transitions. [2018-12-03 15:26:21,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:26:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 836 transitions. [2018-12-03 15:26:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 772 [2018-12-03 15:26:21,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:21,771 INFO L402 BasicCegarLoop]: trace histogram [640, 64, 64, 1, 1, 1] [2018-12-03 15:26:21,771 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:21,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash -697161853, now seen corresponding path program 68 times [2018-12-03 15:26:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:21,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 15:26:23,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:23,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:23,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:23,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:23,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:23,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:23,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:23,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:26,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 385 check-sat command(s) [2018-12-03 15:26:26,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:26,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 15:26:26,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 249536 backedges. 0 proven. 246016 refuted. 0 times theorem prover too weak. 3520 trivial. 0 not checked. [2018-12-03 15:26:31,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:31,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 15:26:31,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:31,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:26:31,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:26:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:26:31,882 INFO L87 Difference]: Start difference. First operand 772 states and 836 transitions. Second operand 67 states. [2018-12-03 15:26:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:32,952 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-12-03 15:26:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:26:32,952 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 771 [2018-12-03 15:26:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:32,955 INFO L225 Difference]: With dead ends: 797 [2018-12-03 15:26:32,955 INFO L226 Difference]: Without dead ends: 795 [2018-12-03 15:26:32,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1606 GetRequests, 1476 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:26:32,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-12-03 15:26:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 784. [2018-12-03 15:26:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-12-03 15:26:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 849 transitions. [2018-12-03 15:26:33,590 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 849 transitions. Word has length 771 [2018-12-03 15:26:33,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:33,591 INFO L480 AbstractCegarLoop]: Abstraction has 784 states and 849 transitions. [2018-12-03 15:26:33,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:26:33,591 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 849 transitions. [2018-12-03 15:26:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 784 [2018-12-03 15:26:33,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:33,595 INFO L402 BasicCegarLoop]: trace histogram [650, 65, 65, 1, 1, 1] [2018-12-03 15:26:33,595 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:33,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:33,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1869922611, now seen corresponding path program 69 times [2018-12-03 15:26:33,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:33,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:33,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:33,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 15:26:35,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:35,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:35,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:35,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:35,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:35,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:35,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:36,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:36,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:36,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 15:26:36,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 257400 backedges. 0 proven. 253825 refuted. 0 times theorem prover too weak. 3575 trivial. 0 not checked. [2018-12-03 15:26:41,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:41,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 15:26:41,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:41,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:26:41,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:26:41,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:26:41,659 INFO L87 Difference]: Start difference. First operand 784 states and 849 transitions. Second operand 68 states. [2018-12-03 15:26:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:42,769 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-12-03 15:26:42,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:26:42,769 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 783 [2018-12-03 15:26:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:42,772 INFO L225 Difference]: With dead ends: 809 [2018-12-03 15:26:42,772 INFO L226 Difference]: Without dead ends: 807 [2018-12-03 15:26:42,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1631 GetRequests, 1499 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:26:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-12-03 15:26:43,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 796. [2018-12-03 15:26:43,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-12-03 15:26:43,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 862 transitions. [2018-12-03 15:26:43,367 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 862 transitions. Word has length 783 [2018-12-03 15:26:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:43,367 INFO L480 AbstractCegarLoop]: Abstraction has 796 states and 862 transitions. [2018-12-03 15:26:43,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:26:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 862 transitions. [2018-12-03 15:26:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 796 [2018-12-03 15:26:43,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:43,372 INFO L402 BasicCegarLoop]: trace histogram [660, 66, 66, 1, 1, 1] [2018-12-03 15:26:43,372 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:43,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1533429993, now seen corresponding path program 70 times [2018-12-03 15:26:43,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:43,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:43,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:43,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:43,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 15:26:45,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:45,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:45,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:45,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:45,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:45,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:45,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:45,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:46,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 15:26:46,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 265386 backedges. 0 proven. 261756 refuted. 0 times theorem prover too weak. 3630 trivial. 0 not checked. [2018-12-03 15:26:52,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:52,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 15:26:52,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:52,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:26:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:26:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:26:52,189 INFO L87 Difference]: Start difference. First operand 796 states and 862 transitions. Second operand 69 states. [2018-12-03 15:26:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:53,286 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-12-03 15:26:53,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:26:53,286 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 795 [2018-12-03 15:26:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:53,289 INFO L225 Difference]: With dead ends: 821 [2018-12-03 15:26:53,289 INFO L226 Difference]: Without dead ends: 819 [2018-12-03 15:26:53,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1656 GetRequests, 1522 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:26:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-12-03 15:26:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 808. [2018-12-03 15:26:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-12-03 15:26:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 875 transitions. [2018-12-03 15:26:53,924 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 875 transitions. Word has length 795 [2018-12-03 15:26:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:53,924 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 875 transitions. [2018-12-03 15:26:53,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:26:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 875 transitions. [2018-12-03 15:26:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2018-12-03 15:26:53,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:53,929 INFO L402 BasicCegarLoop]: trace histogram [670, 67, 67, 1, 1, 1] [2018-12-03 15:26:53,929 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:53,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1888751713, now seen corresponding path program 71 times [2018-12-03 15:26:53,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:53,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:53,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:56,176 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 15:26:56,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:56,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:56,177 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:56,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:56,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:56,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:56,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:56,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:58,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 398 check-sat command(s) [2018-12-03 15:26:58,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:58,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 15:26:59,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 273494 backedges. 0 proven. 269809 refuted. 0 times theorem prover too weak. 3685 trivial. 0 not checked. [2018-12-03 15:27:04,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:04,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 15:27:04,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:04,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:27:04,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:27:04,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:27:04,721 INFO L87 Difference]: Start difference. First operand 808 states and 875 transitions. Second operand 70 states. [2018-12-03 15:27:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:05,802 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-12-03 15:27:05,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:27:05,802 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 807 [2018-12-03 15:27:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:05,805 INFO L225 Difference]: With dead ends: 833 [2018-12-03 15:27:05,805 INFO L226 Difference]: Without dead ends: 831 [2018-12-03 15:27:05,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1681 GetRequests, 1545 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:27:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-12-03 15:27:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 820. [2018-12-03 15:27:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2018-12-03 15:27:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 888 transitions. [2018-12-03 15:27:06,512 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 888 transitions. Word has length 807 [2018-12-03 15:27:06,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:06,512 INFO L480 AbstractCegarLoop]: Abstraction has 820 states and 888 transitions. [2018-12-03 15:27:06,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:27:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 888 transitions. [2018-12-03 15:27:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2018-12-03 15:27:06,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:06,517 INFO L402 BasicCegarLoop]: trace histogram [680, 68, 68, 1, 1, 1] [2018-12-03 15:27:06,517 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:06,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:06,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1800353109, now seen corresponding path program 72 times [2018-12-03 15:27:06,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:06,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:06,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:06,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:06,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 15:27:09,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:09,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:09,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:09,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:09,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:09,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:09,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:09,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:09,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:09,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:09,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 15:27:10,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 281724 backedges. 0 proven. 277984 refuted. 0 times theorem prover too weak. 3740 trivial. 0 not checked. [2018-12-03 15:27:16,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:16,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 15:27:16,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:16,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:27:16,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:27:16,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:27:16,104 INFO L87 Difference]: Start difference. First operand 820 states and 888 transitions. Second operand 71 states. [2018-12-03 15:27:17,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:17,267 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-12-03 15:27:17,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:27:17,267 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 819 [2018-12-03 15:27:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:17,271 INFO L225 Difference]: With dead ends: 845 [2018-12-03 15:27:17,271 INFO L226 Difference]: Without dead ends: 843 [2018-12-03 15:27:17,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1706 GetRequests, 1568 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:27:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-12-03 15:27:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 832. [2018-12-03 15:27:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2018-12-03 15:27:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 901 transitions. [2018-12-03 15:27:17,956 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 901 transitions. Word has length 819 [2018-12-03 15:27:17,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:17,956 INFO L480 AbstractCegarLoop]: Abstraction has 832 states and 901 transitions. [2018-12-03 15:27:17,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:27:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 901 transitions. [2018-12-03 15:27:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-12-03 15:27:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:17,961 INFO L402 BasicCegarLoop]: trace histogram [690, 69, 69, 1, 1, 1] [2018-12-03 15:27:17,961 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:17,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1822005771, now seen corresponding path program 73 times [2018-12-03 15:27:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:17,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:17,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:17,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 15:27:20,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:20,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:20,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:20,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:20,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:20,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:20,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:20,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:20,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 15:27:21,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 290076 backedges. 0 proven. 286281 refuted. 0 times theorem prover too weak. 3795 trivial. 0 not checked. [2018-12-03 15:27:27,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:27,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 15:27:27,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:27,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:27:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:27:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:27:27,314 INFO L87 Difference]: Start difference. First operand 832 states and 901 transitions. Second operand 72 states. [2018-12-03 15:27:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:28,507 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-12-03 15:27:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:27:28,508 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 831 [2018-12-03 15:27:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:28,510 INFO L225 Difference]: With dead ends: 857 [2018-12-03 15:27:28,511 INFO L226 Difference]: Without dead ends: 855 [2018-12-03 15:27:28,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1731 GetRequests, 1591 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:27:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-12-03 15:27:29,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 844. [2018-12-03 15:27:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-12-03 15:27:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 914 transitions. [2018-12-03 15:27:29,277 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 914 transitions. Word has length 831 [2018-12-03 15:27:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:29,278 INFO L480 AbstractCegarLoop]: Abstraction has 844 states and 914 transitions. [2018-12-03 15:27:29,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:27:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 914 transitions. [2018-12-03 15:27:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-12-03 15:27:29,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:29,285 INFO L402 BasicCegarLoop]: trace histogram [700, 70, 70, 1, 1, 1] [2018-12-03 15:27:29,285 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:29,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:29,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1902862911, now seen corresponding path program 74 times [2018-12-03 15:27:29,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:29,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:29,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 15:27:31,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:31,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:31,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:31,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:31,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:31,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:31,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:31,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:34,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 421 check-sat command(s) [2018-12-03 15:27:34,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:34,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 15:27:34,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 298550 backedges. 0 proven. 294700 refuted. 0 times theorem prover too weak. 3850 trivial. 0 not checked. [2018-12-03 15:27:41,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:41,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 15:27:41,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:41,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:27:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:27:41,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:27:41,085 INFO L87 Difference]: Start difference. First operand 844 states and 914 transitions. Second operand 73 states. [2018-12-03 15:27:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:42,326 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-12-03 15:27:42,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:27:42,326 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 843 [2018-12-03 15:27:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:42,328 INFO L225 Difference]: With dead ends: 869 [2018-12-03 15:27:42,328 INFO L226 Difference]: Without dead ends: 867 [2018-12-03 15:27:42,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1756 GetRequests, 1614 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:27:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-12-03 15:27:43,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 856. [2018-12-03 15:27:43,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-12-03 15:27:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 927 transitions. [2018-12-03 15:27:43,112 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 927 transitions. Word has length 843 [2018-12-03 15:27:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:43,113 INFO L480 AbstractCegarLoop]: Abstraction has 856 states and 927 transitions. [2018-12-03 15:27:43,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:27:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 927 transitions. [2018-12-03 15:27:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2018-12-03 15:27:43,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:43,118 INFO L402 BasicCegarLoop]: trace histogram [710, 71, 71, 1, 1, 1] [2018-12-03 15:27:43,118 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:43,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1438007177, now seen corresponding path program 75 times [2018-12-03 15:27:43,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:43,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:43,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 15:27:45,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:45,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:45,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:45,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:45,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:45,668 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:45,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:46,169 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:46,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:46,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 15:27:46,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:52,881 INFO L134 CoverageAnalysis]: Checked inductivity of 307146 backedges. 0 proven. 303241 refuted. 0 times theorem prover too weak. 3905 trivial. 0 not checked. [2018-12-03 15:27:52,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 15:27:52,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:52,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:27:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:27:52,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:27:52,906 INFO L87 Difference]: Start difference. First operand 856 states and 927 transitions. Second operand 74 states. [2018-12-03 15:27:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:54,186 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-12-03 15:27:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:27:54,186 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 855 [2018-12-03 15:27:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:54,188 INFO L225 Difference]: With dead ends: 881 [2018-12-03 15:27:54,188 INFO L226 Difference]: Without dead ends: 879 [2018-12-03 15:27:54,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1637 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:27:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-12-03 15:27:54,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 868. [2018-12-03 15:27:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-12-03 15:27:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 940 transitions. [2018-12-03 15:27:54,978 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 940 transitions. Word has length 855 [2018-12-03 15:27:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:54,978 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 940 transitions. [2018-12-03 15:27:54,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:27:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 940 transitions. [2018-12-03 15:27:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-12-03 15:27:54,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:54,984 INFO L402 BasicCegarLoop]: trace histogram [720, 72, 72, 1, 1, 1] [2018-12-03 15:27:54,984 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:54,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 696090067, now seen corresponding path program 76 times [2018-12-03 15:27:54,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:54,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:54,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:54,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 15:27:57,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:57,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:57,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:57,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:57,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:57,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:57,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:57,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:58,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:58,595 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 15:27:58,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 315864 backedges. 0 proven. 311904 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2018-12-03 15:28:05,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:05,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 15:28:05,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:05,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:28:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:28:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:28:05,077 INFO L87 Difference]: Start difference. First operand 868 states and 940 transitions. Second operand 75 states. [2018-12-03 15:28:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:06,386 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-12-03 15:28:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:28:06,387 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 867 [2018-12-03 15:28:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:06,388 INFO L225 Difference]: With dead ends: 893 [2018-12-03 15:28:06,388 INFO L226 Difference]: Without dead ends: 891 [2018-12-03 15:28:06,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1806 GetRequests, 1660 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:28:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-12-03 15:28:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 880. [2018-12-03 15:28:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-12-03 15:28:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 953 transitions. [2018-12-03 15:28:07,204 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 953 transitions. Word has length 867 [2018-12-03 15:28:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:07,205 INFO L480 AbstractCegarLoop]: Abstraction has 880 states and 953 transitions. [2018-12-03 15:28:07,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:28:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 953 transitions. [2018-12-03 15:28:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 880 [2018-12-03 15:28:07,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:07,211 INFO L402 BasicCegarLoop]: trace histogram [730, 73, 73, 1, 1, 1] [2018-12-03 15:28:07,211 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:07,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash 943168797, now seen corresponding path program 77 times [2018-12-03 15:28:07,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:07,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:07,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 15:28:10,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:10,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:10,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:10,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:10,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:10,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:10,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:28:10,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:28:13,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 434 check-sat command(s) [2018-12-03 15:28:13,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:13,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:13,617 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 15:28:13,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:20,392 INFO L134 CoverageAnalysis]: Checked inductivity of 324704 backedges. 0 proven. 320689 refuted. 0 times theorem prover too weak. 4015 trivial. 0 not checked. [2018-12-03 15:28:20,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:20,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 15:28:20,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:20,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:28:20,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:28:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:28:20,415 INFO L87 Difference]: Start difference. First operand 880 states and 953 transitions. Second operand 76 states. [2018-12-03 15:28:21,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:21,725 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-12-03 15:28:21,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:28:21,726 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 879 [2018-12-03 15:28:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:21,727 INFO L225 Difference]: With dead ends: 905 [2018-12-03 15:28:21,727 INFO L226 Difference]: Without dead ends: 903 [2018-12-03 15:28:21,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1831 GetRequests, 1683 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:28:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-12-03 15:28:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 892. [2018-12-03 15:28:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-12-03 15:28:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 966 transitions. [2018-12-03 15:28:22,499 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 966 transitions. Word has length 879 [2018-12-03 15:28:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:22,500 INFO L480 AbstractCegarLoop]: Abstraction has 892 states and 966 transitions. [2018-12-03 15:28:22,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:28:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 966 transitions. [2018-12-03 15:28:22,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-12-03 15:28:22,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:22,507 INFO L402 BasicCegarLoop]: trace histogram [740, 74, 74, 1, 1, 1] [2018-12-03 15:28:22,508 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:22,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash -811917977, now seen corresponding path program 78 times [2018-12-03 15:28:22,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:22,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:22,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 15:28:25,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:25,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:25,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:25,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:25,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:25,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:25,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:28:25,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:28:25,888 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:28:25,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:25,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:26,431 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 15:28:26,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 333666 backedges. 0 proven. 329596 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-12-03 15:28:33,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:33,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 15:28:33,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:33,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:28:33,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:28:33,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:28:33,228 INFO L87 Difference]: Start difference. First operand 892 states and 966 transitions. Second operand 77 states. [2018-12-03 15:28:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:34,613 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-12-03 15:28:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:28:34,613 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 891 [2018-12-03 15:28:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:34,615 INFO L225 Difference]: With dead ends: 917 [2018-12-03 15:28:34,615 INFO L226 Difference]: Without dead ends: 915 [2018-12-03 15:28:34,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1856 GetRequests, 1706 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:28:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-12-03 15:28:35,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 904. [2018-12-03 15:28:35,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 15:28:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 979 transitions. [2018-12-03 15:28:35,400 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 979 transitions. Word has length 891 [2018-12-03 15:28:35,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:35,401 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 979 transitions. [2018-12-03 15:28:35,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:28:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 979 transitions. [2018-12-03 15:28:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2018-12-03 15:28:35,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:35,406 INFO L402 BasicCegarLoop]: trace histogram [750, 75, 75, 1, 1, 1] [2018-12-03 15:28:35,406 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:35,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash -543261007, now seen corresponding path program 79 times [2018-12-03 15:28:35,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:35,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:35,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:35,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:38,757 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 15:28:38,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:38,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:38,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:38,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:38,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:38,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:38,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:38,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:28:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:39,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 15:28:39,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 342750 backedges. 0 proven. 338625 refuted. 0 times theorem prover too weak. 4125 trivial. 0 not checked. [2018-12-03 15:28:46,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:46,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 15:28:46,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:46,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:28:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:28:46,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:28:46,722 INFO L87 Difference]: Start difference. First operand 904 states and 979 transitions. Second operand 78 states. [2018-12-03 15:28:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:48,055 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-12-03 15:28:48,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:28:48,055 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 903 [2018-12-03 15:28:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:48,057 INFO L225 Difference]: With dead ends: 929 [2018-12-03 15:28:48,057 INFO L226 Difference]: Without dead ends: 927 [2018-12-03 15:28:48,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1881 GetRequests, 1729 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:28:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-12-03 15:28:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 916. [2018-12-03 15:28:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916 states. [2018-12-03 15:28:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 992 transitions. [2018-12-03 15:28:48,880 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 992 transitions. Word has length 903 [2018-12-03 15:28:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:48,880 INFO L480 AbstractCegarLoop]: Abstraction has 916 states and 992 transitions. [2018-12-03 15:28:48,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:28:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 992 transitions. [2018-12-03 15:28:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 916 [2018-12-03 15:28:48,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:48,886 INFO L402 BasicCegarLoop]: trace histogram [760, 76, 76, 1, 1, 1] [2018-12-03 15:28:48,886 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:48,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:48,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1703395077, now seen corresponding path program 80 times [2018-12-03 15:28:48,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:48,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:48,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:48,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 15:28:52,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:52,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:52,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:52,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:52,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:52,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:28:52,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:28:55,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 457 check-sat command(s) [2018-12-03 15:28:55,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:55,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 15:28:55,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 351956 backedges. 0 proven. 347776 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-12-03 15:29:03,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:03,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 15:29:03,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:03,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:29:03,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:29:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:29:03,174 INFO L87 Difference]: Start difference. First operand 916 states and 992 transitions. Second operand 79 states. [2018-12-03 15:29:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:04,621 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-12-03 15:29:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:29:04,621 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 915 [2018-12-03 15:29:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:04,623 INFO L225 Difference]: With dead ends: 941 [2018-12-03 15:29:04,623 INFO L226 Difference]: Without dead ends: 939 [2018-12-03 15:29:04,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1906 GetRequests, 1752 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:29:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-12-03 15:29:05,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 928. [2018-12-03 15:29:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-12-03 15:29:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1005 transitions. [2018-12-03 15:29:05,489 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1005 transitions. Word has length 915 [2018-12-03 15:29:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:05,489 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1005 transitions. [2018-12-03 15:29:05,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:29:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1005 transitions. [2018-12-03 15:29:05,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2018-12-03 15:29:05,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:05,495 INFO L402 BasicCegarLoop]: trace histogram [770, 77, 77, 1, 1, 1] [2018-12-03 15:29:05,495 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:05,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:05,496 INFO L82 PathProgramCache]: Analyzing trace with hash 345957445, now seen corresponding path program 81 times [2018-12-03 15:29:05,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:05,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:05,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:05,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:05,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 15:29:08,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:08,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:08,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:08,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:08,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:08,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:08,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:29:08,400 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:29:08,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:29:08,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:08,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 15:29:09,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 361284 backedges. 0 proven. 357049 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2018-12-03 15:29:16,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:16,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 15:29:16,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:16,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:29:16,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:29:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:29:16,972 INFO L87 Difference]: Start difference. First operand 928 states and 1005 transitions. Second operand 80 states. [2018-12-03 15:29:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:18,457 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-12-03 15:29:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:29:18,457 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 927 [2018-12-03 15:29:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:18,459 INFO L225 Difference]: With dead ends: 953 [2018-12-03 15:29:18,459 INFO L226 Difference]: Without dead ends: 951 [2018-12-03 15:29:18,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1931 GetRequests, 1775 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:29:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-12-03 15:29:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 940. [2018-12-03 15:29:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2018-12-03 15:29:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1018 transitions. [2018-12-03 15:29:19,500 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1018 transitions. Word has length 927 [2018-12-03 15:29:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:19,501 INFO L480 AbstractCegarLoop]: Abstraction has 940 states and 1018 transitions. [2018-12-03 15:29:19,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:29:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1018 transitions. [2018-12-03 15:29:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2018-12-03 15:29:19,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:19,510 INFO L402 BasicCegarLoop]: trace histogram [780, 78, 78, 1, 1, 1] [2018-12-03 15:29:19,510 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:19,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -456595313, now seen corresponding path program 82 times [2018-12-03 15:29:19,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:19,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:19,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 15:29:22,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:22,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:22,785 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:22,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:22,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:22,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:22,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:22,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:29:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:23,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 15:29:23,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 370734 backedges. 0 proven. 366444 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-12-03 15:29:31,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:31,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 15:29:31,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:31,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:29:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:29:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:29:31,694 INFO L87 Difference]: Start difference. First operand 940 states and 1018 transitions. Second operand 81 states. [2018-12-03 15:29:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:33,215 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-12-03 15:29:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:29:33,216 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 939 [2018-12-03 15:29:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:33,217 INFO L225 Difference]: With dead ends: 965 [2018-12-03 15:29:33,218 INFO L226 Difference]: Without dead ends: 963 [2018-12-03 15:29:33,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1956 GetRequests, 1798 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:29:33,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-12-03 15:29:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 952. [2018-12-03 15:29:34,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-12-03 15:29:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1031 transitions. [2018-12-03 15:29:34,169 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1031 transitions. Word has length 939 [2018-12-03 15:29:34,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:34,169 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 1031 transitions. [2018-12-03 15:29:34,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:29:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1031 transitions. [2018-12-03 15:29:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2018-12-03 15:29:34,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:34,177 INFO L402 BasicCegarLoop]: trace histogram [790, 79, 79, 1, 1, 1] [2018-12-03 15:29:34,177 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:34,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:34,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1007890983, now seen corresponding path program 83 times [2018-12-03 15:29:34,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:34,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:34,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:37,473 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 15:29:37,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:37,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:37,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:37,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:37,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:37,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:37,482 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:29:37,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:29:40,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 470 check-sat command(s) [2018-12-03 15:29:40,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:40,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 15:29:41,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:49,196 INFO L134 CoverageAnalysis]: Checked inductivity of 380306 backedges. 0 proven. 375961 refuted. 0 times theorem prover too weak. 4345 trivial. 0 not checked. [2018-12-03 15:29:49,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:49,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 15:29:49,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:49,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:29:49,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:29:49,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:29:49,221 INFO L87 Difference]: Start difference. First operand 952 states and 1031 transitions. Second operand 82 states. [2018-12-03 15:29:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:50,806 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-12-03 15:29:50,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:29:50,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 951 [2018-12-03 15:29:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:50,808 INFO L225 Difference]: With dead ends: 977 [2018-12-03 15:29:50,808 INFO L226 Difference]: Without dead ends: 975 [2018-12-03 15:29:50,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1981 GetRequests, 1821 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:29:50,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-12-03 15:29:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 964. [2018-12-03 15:29:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-12-03 15:29:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1044 transitions. [2018-12-03 15:29:51,789 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1044 transitions. Word has length 951 [2018-12-03 15:29:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:51,790 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1044 transitions. [2018-12-03 15:29:51,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:29:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1044 transitions. [2018-12-03 15:29:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 964 [2018-12-03 15:29:51,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:51,797 INFO L402 BasicCegarLoop]: trace histogram [800, 80, 80, 1, 1, 1] [2018-12-03 15:29:51,797 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:51,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:51,797 INFO L82 PathProgramCache]: Analyzing trace with hash 759239715, now seen corresponding path program 84 times [2018-12-03 15:29:51,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:51,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:51,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:51,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 15:29:54,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:54,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:54,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:54,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:54,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:54,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:54,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:29:54,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:29:55,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:29:55,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:55,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 15:29:56,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 390000 backedges. 0 proven. 385600 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2018-12-03 15:30:04,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:04,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 15:30:04,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:04,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:30:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:30:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:30:04,069 INFO L87 Difference]: Start difference. First operand 964 states and 1044 transitions. Second operand 83 states. [2018-12-03 15:30:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:05,680 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-12-03 15:30:05,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:30:05,680 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 963 [2018-12-03 15:30:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:05,681 INFO L225 Difference]: With dead ends: 989 [2018-12-03 15:30:05,681 INFO L226 Difference]: Without dead ends: 987 [2018-12-03 15:30:05,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2006 GetRequests, 1844 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:30:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-12-03 15:30:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 976. [2018-12-03 15:30:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2018-12-03 15:30:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1057 transitions. [2018-12-03 15:30:06,690 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1057 transitions. Word has length 963 [2018-12-03 15:30:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:06,691 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1057 transitions. [2018-12-03 15:30:06,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:30:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1057 transitions. [2018-12-03 15:30:06,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 976 [2018-12-03 15:30:06,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:06,697 INFO L402 BasicCegarLoop]: trace histogram [810, 81, 81, 1, 1, 1] [2018-12-03 15:30:06,698 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:06,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:06,698 INFO L82 PathProgramCache]: Analyzing trace with hash -29607059, now seen corresponding path program 85 times [2018-12-03 15:30:06,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:06,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:06,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 15:30:10,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:10,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:10,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:10,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:10,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:10,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:30:10,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:10,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:30:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:10,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 15:30:11,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 399816 backedges. 0 proven. 395361 refuted. 0 times theorem prover too weak. 4455 trivial. 0 not checked. [2018-12-03 15:30:19,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:19,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 15:30:19,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:19,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:30:19,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:30:19,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:30:19,449 INFO L87 Difference]: Start difference. First operand 976 states and 1057 transitions. Second operand 84 states. [2018-12-03 15:30:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:21,110 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-12-03 15:30:21,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:30:21,111 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 975 [2018-12-03 15:30:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:21,112 INFO L225 Difference]: With dead ends: 1001 [2018-12-03 15:30:21,112 INFO L226 Difference]: Without dead ends: 999 [2018-12-03 15:30:21,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2031 GetRequests, 1867 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:30:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-12-03 15:30:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 988. [2018-12-03 15:30:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-12-03 15:30:22,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1070 transitions. [2018-12-03 15:30:22,160 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1070 transitions. Word has length 975 [2018-12-03 15:30:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:22,161 INFO L480 AbstractCegarLoop]: Abstraction has 988 states and 1070 transitions. [2018-12-03 15:30:22,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:30:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1070 transitions. [2018-12-03 15:30:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-12-03 15:30:22,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:22,167 INFO L402 BasicCegarLoop]: trace histogram [820, 82, 82, 1, 1, 1] [2018-12-03 15:30:22,167 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:22,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:22,168 INFO L82 PathProgramCache]: Analyzing trace with hash 378848183, now seen corresponding path program 86 times [2018-12-03 15:30:22,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:22,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:22,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 15:30:25,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:25,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:25,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:25,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:25,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:25,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:30:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:30:25,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:30:29,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 493 check-sat command(s) [2018-12-03 15:30:29,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:29,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 15:30:29,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 409754 backedges. 0 proven. 405244 refuted. 0 times theorem prover too weak. 4510 trivial. 0 not checked. [2018-12-03 15:30:38,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:38,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 15:30:38,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:38,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:30:38,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:30:38,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:30:38,500 INFO L87 Difference]: Start difference. First operand 988 states and 1070 transitions. Second operand 85 states. [2018-12-03 15:30:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:40,155 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-12-03 15:30:40,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:30:40,156 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 987 [2018-12-03 15:30:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:40,158 INFO L225 Difference]: With dead ends: 1013 [2018-12-03 15:30:40,158 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 15:30:40,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2056 GetRequests, 1890 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:30:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 15:30:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1000. [2018-12-03 15:30:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2018-12-03 15:30:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1083 transitions. [2018-12-03 15:30:41,356 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1083 transitions. Word has length 987 [2018-12-03 15:30:41,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:41,356 INFO L480 AbstractCegarLoop]: Abstraction has 1000 states and 1083 transitions. [2018-12-03 15:30:41,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:30:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1083 transitions. [2018-12-03 15:30:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1000 [2018-12-03 15:30:41,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:41,363 INFO L402 BasicCegarLoop]: trace histogram [830, 83, 83, 1, 1, 1] [2018-12-03 15:30:41,363 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:41,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash -129946367, now seen corresponding path program 87 times [2018-12-03 15:30:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:41,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:41,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 15:30:44,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:44,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:44,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:44,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:44,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:44,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:30:44,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:30:44,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:30:45,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:30:45,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:45,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:46,145 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 15:30:46,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 419814 backedges. 0 proven. 415249 refuted. 0 times theorem prover too weak. 4565 trivial. 0 not checked. [2018-12-03 15:30:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 15:30:54,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:54,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:30:54,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:30:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:30:54,760 INFO L87 Difference]: Start difference. First operand 1000 states and 1083 transitions. Second operand 86 states. [2018-12-03 15:30:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:56,478 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-12-03 15:30:56,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:30:56,479 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 999 [2018-12-03 15:30:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:56,480 INFO L225 Difference]: With dead ends: 1025 [2018-12-03 15:30:56,480 INFO L226 Difference]: Without dead ends: 1023 [2018-12-03 15:30:56,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2081 GetRequests, 1913 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:30:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-12-03 15:30:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1012. [2018-12-03 15:30:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-12-03 15:30:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1096 transitions. [2018-12-03 15:30:57,510 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1096 transitions. Word has length 999 [2018-12-03 15:30:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:57,510 INFO L480 AbstractCegarLoop]: Abstraction has 1012 states and 1096 transitions. [2018-12-03 15:30:57,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:30:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1096 transitions. [2018-12-03 15:30:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2018-12-03 15:30:57,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:57,516 INFO L402 BasicCegarLoop]: trace histogram [840, 84, 84, 1, 1, 1] [2018-12-03 15:30:57,517 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:57,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:57,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1735915339, now seen corresponding path program 88 times [2018-12-03 15:30:57,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:57,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:57,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 15:31:01,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:01,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:01,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:01,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 15:31:01,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:01,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:01,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:01,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:31:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:01,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 15:31:02,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 429996 backedges. 0 proven. 425376 refuted. 0 times theorem prover too weak. 4620 trivial. 0 not checked. [2018-12-03 15:31:11,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:11,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 15:31:11,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:11,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 15:31:11,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 15:31:11,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:31:11,307 INFO L87 Difference]: Start difference. First operand 1012 states and 1096 transitions. Second operand 87 states. [2018-12-03 15:31:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:13,053 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-12-03 15:31:13,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:31:13,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1011 [2018-12-03 15:31:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:13,055 INFO L225 Difference]: With dead ends: 1037 [2018-12-03 15:31:13,055 INFO L226 Difference]: Without dead ends: 1035 [2018-12-03 15:31:13,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2106 GetRequests, 1936 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:31:13,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-12-03 15:31:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1024. [2018-12-03 15:31:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-12-03 15:31:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1109 transitions. [2018-12-03 15:31:14,324 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1109 transitions. Word has length 1011 [2018-12-03 15:31:14,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:14,324 INFO L480 AbstractCegarLoop]: Abstraction has 1024 states and 1109 transitions. [2018-12-03 15:31:14,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 15:31:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1109 transitions. [2018-12-03 15:31:14,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-12-03 15:31:14,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:14,331 INFO L402 BasicCegarLoop]: trace histogram [850, 85, 85, 1, 1, 1] [2018-12-03 15:31:14,331 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:14,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:14,332 INFO L82 PathProgramCache]: Analyzing trace with hash 179282581, now seen corresponding path program 89 times [2018-12-03 15:31:14,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:14,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:14,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:14,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 15:31:17,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:17,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:17,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:17,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:17,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:17,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:17,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:31:17,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:31:21,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 506 check-sat command(s) [2018-12-03 15:31:21,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:31:21,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 15:31:22,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 440300 backedges. 0 proven. 435625 refuted. 0 times theorem prover too weak. 4675 trivial. 0 not checked. [2018-12-03 15:31:31,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:31,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 15:31:31,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:31,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:31:31,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:31:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:31:31,640 INFO L87 Difference]: Start difference. First operand 1024 states and 1109 transitions. Second operand 88 states. [2018-12-03 15:31:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:33,444 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-12-03 15:31:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:31:33,444 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1023 [2018-12-03 15:31:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:33,445 INFO L225 Difference]: With dead ends: 1049 [2018-12-03 15:31:33,446 INFO L226 Difference]: Without dead ends: 1047 [2018-12-03 15:31:33,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 1959 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:31:33,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-12-03 15:31:34,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1036. [2018-12-03 15:31:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-12-03 15:31:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1122 transitions. [2018-12-03 15:31:34,539 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1122 transitions. Word has length 1023 [2018-12-03 15:31:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:34,539 INFO L480 AbstractCegarLoop]: Abstraction has 1036 states and 1122 transitions. [2018-12-03 15:31:34,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:31:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1122 transitions. [2018-12-03 15:31:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2018-12-03 15:31:34,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:34,546 INFO L402 BasicCegarLoop]: trace histogram [860, 86, 86, 1, 1, 1] [2018-12-03 15:31:34,546 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:34,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 178171615, now seen corresponding path program 90 times [2018-12-03 15:31:34,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:34,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:34,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:34,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:34,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 15:31:38,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:38,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:38,233 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:38,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 15:31:38,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:38,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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:38,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:31:38,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:31:38,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:31:38,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:31:38,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 15:31:39,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 450726 backedges. 0 proven. 445996 refuted. 0 times theorem prover too weak. 4730 trivial. 0 not checked. [2018-12-03 15:31:48,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:48,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 15:31:48,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:48,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:31:48,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:31:48,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:31:48,715 INFO L87 Difference]: Start difference. First operand 1036 states and 1122 transitions. Second operand 89 states. [2018-12-03 15:31:50,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:50,604 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-12-03 15:31:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:31:50,604 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1035 [2018-12-03 15:31:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:50,605 INFO L225 Difference]: With dead ends: 1061 [2018-12-03 15:31:50,606 INFO L226 Difference]: Without dead ends: 1059 [2018-12-03 15:31:50,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2156 GetRequests, 1982 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:31:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-12-03 15:31:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1048. [2018-12-03 15:31:51,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2018-12-03 15:31:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1135 transitions. [2018-12-03 15:31:51,864 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1135 transitions. Word has length 1035 [2018-12-03 15:31:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:51,864 INFO L480 AbstractCegarLoop]: Abstraction has 1048 states and 1135 transitions. [2018-12-03 15:31:51,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:31:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1135 transitions. [2018-12-03 15:31:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2018-12-03 15:31:51,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:51,872 INFO L402 BasicCegarLoop]: trace histogram [870, 87, 87, 1, 1, 1] [2018-12-03 15:31:51,872 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:51,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:51,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1304716247, now seen corresponding path program 91 times [2018-12-03 15:31:51,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:51,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:51,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:51,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:51,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 15:31:55,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:55,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:55,817 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:55,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:55,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:55,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:55,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:55,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:31:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:56,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 15:31:57,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 461274 backedges. 0 proven. 456489 refuted. 0 times theorem prover too weak. 4785 trivial. 0 not checked. [2018-12-03 15:32:06,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:06,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 15:32:06,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:06,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:32:06,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:32:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:32:06,538 INFO L87 Difference]: Start difference. First operand 1048 states and 1135 transitions. Second operand 90 states. [2018-12-03 15:32:08,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:08,388 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-12-03 15:32:08,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:32:08,389 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1047 [2018-12-03 15:32:08,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:08,390 INFO L225 Difference]: With dead ends: 1073 [2018-12-03 15:32:08,390 INFO L226 Difference]: Without dead ends: 1071 [2018-12-03 15:32:08,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2181 GetRequests, 2005 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:32:08,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-12-03 15:32:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1060. [2018-12-03 15:32:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-12-03 15:32:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1148 transitions. [2018-12-03 15:32:09,752 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1148 transitions. Word has length 1047 [2018-12-03 15:32:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:09,753 INFO L480 AbstractCegarLoop]: Abstraction has 1060 states and 1148 transitions. [2018-12-03 15:32:09,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:32:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1148 transitions. [2018-12-03 15:32:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2018-12-03 15:32:09,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:09,761 INFO L402 BasicCegarLoop]: trace histogram [880, 88, 88, 1, 1, 1] [2018-12-03 15:32:09,761 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:09,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:09,761 INFO L82 PathProgramCache]: Analyzing trace with hash 247261811, now seen corresponding path program 92 times [2018-12-03 15:32:09,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:09,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:09,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:09,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:09,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 15:32:13,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:13,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:13,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:13,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:13,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:13,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:32:13,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:32:13,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:32:17,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 529 check-sat command(s) [2018-12-03 15:32:17,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:17,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 15:32:18,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 471944 backedges. 0 proven. 467104 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2018-12-03 15:32:28,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:28,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 15:32:28,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:28,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 15:32:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 15:32:28,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:32:28,744 INFO L87 Difference]: Start difference. First operand 1060 states and 1148 transitions. Second operand 91 states. [2018-12-03 15:32:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:30,598 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-12-03 15:32:30,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:32:30,598 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1059 [2018-12-03 15:32:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:30,600 INFO L225 Difference]: With dead ends: 1085 [2018-12-03 15:32:30,600 INFO L226 Difference]: Without dead ends: 1083 [2018-12-03 15:32:30,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2206 GetRequests, 2028 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:32:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-12-03 15:32:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1072. [2018-12-03 15:32:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1072 states. [2018-12-03 15:32:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1161 transitions. [2018-12-03 15:32:31,919 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1161 transitions. Word has length 1059 [2018-12-03 15:32:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:31,920 INFO L480 AbstractCegarLoop]: Abstraction has 1072 states and 1161 transitions. [2018-12-03 15:32:31,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 15:32:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1161 transitions. [2018-12-03 15:32:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1072 [2018-12-03 15:32:31,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:31,928 INFO L402 BasicCegarLoop]: trace histogram [890, 89, 89, 1, 1, 1] [2018-12-03 15:32:31,928 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:31,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1885791811, now seen corresponding path program 93 times [2018-12-03 15:32:31,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:31,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:31,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 15:32:36,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:36,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:36,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:36,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:36,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:36,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:32:36,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:32:36,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:32:36,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:32:36,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:36,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 15:32:37,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 482736 backedges. 0 proven. 477841 refuted. 0 times theorem prover too weak. 4895 trivial. 0 not checked. [2018-12-03 15:32:47,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:47,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 15:32:47,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:47,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:32:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:32:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:32:47,257 INFO L87 Difference]: Start difference. First operand 1072 states and 1161 transitions. Second operand 92 states. [2018-12-03 15:32:49,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:49,294 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-12-03 15:32:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:32:49,294 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1071 [2018-12-03 15:32:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:49,295 INFO L225 Difference]: With dead ends: 1097 [2018-12-03 15:32:49,296 INFO L226 Difference]: Without dead ends: 1095 [2018-12-03 15:32:49,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2231 GetRequests, 2051 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:32:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-12-03 15:32:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1084. [2018-12-03 15:32:50,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-12-03 15:32:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1174 transitions. [2018-12-03 15:32:50,609 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1174 transitions. Word has length 1071 [2018-12-03 15:32:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:50,609 INFO L480 AbstractCegarLoop]: Abstraction has 1084 states and 1174 transitions. [2018-12-03 15:32:50,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:32:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1174 transitions. [2018-12-03 15:32:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2018-12-03 15:32:50,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:50,617 INFO L402 BasicCegarLoop]: trace histogram [900, 90, 90, 1, 1, 1] [2018-12-03 15:32:50,617 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:50,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1501124089, now seen corresponding path program 94 times [2018-12-03 15:32:50,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:50,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:50,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 15:32:54,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:54,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:54,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:54,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:54,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:54,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:32:54,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:54,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:32:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:55,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 15:32:55,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 493650 backedges. 0 proven. 488700 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 15:33:05,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:05,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 15:33:05,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:05,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 15:33:05,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 15:33:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:33:05,692 INFO L87 Difference]: Start difference. First operand 1084 states and 1174 transitions. Second operand 93 states. [2018-12-03 15:33:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:07,649 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-12-03 15:33:07,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:33:07,650 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1083 [2018-12-03 15:33:07,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:07,651 INFO L225 Difference]: With dead ends: 1109 [2018-12-03 15:33:07,651 INFO L226 Difference]: Without dead ends: 1107 [2018-12-03 15:33:07,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2256 GetRequests, 2074 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:33:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-12-03 15:33:08,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1096. [2018-12-03 15:33:08,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2018-12-03 15:33:08,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1187 transitions. [2018-12-03 15:33:08,889 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1187 transitions. Word has length 1083 [2018-12-03 15:33:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:08,889 INFO L480 AbstractCegarLoop]: Abstraction has 1096 states and 1187 transitions. [2018-12-03 15:33:08,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 15:33:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1187 transitions. [2018-12-03 15:33:08,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-12-03 15:33:08,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:08,897 INFO L402 BasicCegarLoop]: trace histogram [910, 91, 91, 1, 1, 1] [2018-12-03 15:33:08,897 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:08,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1736186705, now seen corresponding path program 95 times [2018-12-03 15:33:08,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:08,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:08,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:08,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:08,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 15:33:13,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:13,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:13,110 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:13,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:13,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:13,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:13,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:13,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:17,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 542 check-sat command(s) [2018-12-03 15:33:17,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:17,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 15:33:18,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 504686 backedges. 0 proven. 499681 refuted. 0 times theorem prover too weak. 5005 trivial. 0 not checked. [2018-12-03 15:33:28,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:28,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 15:33:28,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:28,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:33:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:33:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:33:28,918 INFO L87 Difference]: Start difference. First operand 1096 states and 1187 transitions. Second operand 94 states. [2018-12-03 15:33:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:31,018 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-12-03 15:33:31,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:33:31,018 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1095 [2018-12-03 15:33:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:31,019 INFO L225 Difference]: With dead ends: 1121 [2018-12-03 15:33:31,020 INFO L226 Difference]: Without dead ends: 1119 [2018-12-03 15:33:31,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2281 GetRequests, 2097 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:33:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-12-03 15:33:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1108. [2018-12-03 15:33:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-12-03 15:33:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1200 transitions. [2018-12-03 15:33:32,326 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1200 transitions. Word has length 1095 [2018-12-03 15:33:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:32,326 INFO L480 AbstractCegarLoop]: Abstraction has 1108 states and 1200 transitions. [2018-12-03 15:33:32,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:33:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1200 transitions. [2018-12-03 15:33:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2018-12-03 15:33:32,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:32,334 INFO L402 BasicCegarLoop]: trace histogram [920, 92, 92, 1, 1, 1] [2018-12-03 15:33:32,334 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:32,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 682618267, now seen corresponding path program 96 times [2018-12-03 15:33:32,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:32,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:32,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:32,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:32,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 15:33:36,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:36,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:36,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:36,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:36,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:36,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:36,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:36,427 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:37,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:37,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:37,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 15:33:37,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:48,346 INFO L134 CoverageAnalysis]: Checked inductivity of 515844 backedges. 0 proven. 510784 refuted. 0 times theorem prover too weak. 5060 trivial. 0 not checked. [2018-12-03 15:33:48,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:48,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 15:33:48,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:48,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:33:48,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:33:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:33:48,371 INFO L87 Difference]: Start difference. First operand 1108 states and 1200 transitions. Second operand 95 states. [2018-12-03 15:33:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:50,510 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-12-03 15:33:50,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:33:50,510 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1107 [2018-12-03 15:33:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:50,511 INFO L225 Difference]: With dead ends: 1133 [2018-12-03 15:33:50,511 INFO L226 Difference]: Without dead ends: 1131 [2018-12-03 15:33:50,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2306 GetRequests, 2120 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:33:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-12-03 15:33:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1120. [2018-12-03 15:33:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1120 states. [2018-12-03 15:33:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1213 transitions. [2018-12-03 15:33:51,944 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1213 transitions. Word has length 1107 [2018-12-03 15:33:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:51,945 INFO L480 AbstractCegarLoop]: Abstraction has 1120 states and 1213 transitions. [2018-12-03 15:33:51,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:33:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1213 transitions. [2018-12-03 15:33:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1120 [2018-12-03 15:33:51,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:51,954 INFO L402 BasicCegarLoop]: trace histogram [930, 93, 93, 1, 1, 1] [2018-12-03 15:33:51,954 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:51,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash 580428005, now seen corresponding path program 97 times [2018-12-03 15:33:51,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:51,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:51,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 15:33:56,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:56,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:56,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:56,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:56,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:56,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:56,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:56,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:56,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 15:33:57,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 527124 backedges. 0 proven. 522009 refuted. 0 times theorem prover too weak. 5115 trivial. 0 not checked. [2018-12-03 15:34:08,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:08,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 15:34:08,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:08,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:34:08,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:34:08,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:34:08,432 INFO L87 Difference]: Start difference. First operand 1120 states and 1213 transitions. Second operand 96 states. [2018-12-03 15:34:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:10,577 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-12-03 15:34:10,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:34:10,577 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1119 [2018-12-03 15:34:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:10,578 INFO L225 Difference]: With dead ends: 1145 [2018-12-03 15:34:10,578 INFO L226 Difference]: Without dead ends: 1143 [2018-12-03 15:34:10,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2331 GetRequests, 2143 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:34:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-12-03 15:34:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1132. [2018-12-03 15:34:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2018-12-03 15:34:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1226 transitions. [2018-12-03 15:34:12,001 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1226 transitions. Word has length 1119 [2018-12-03 15:34:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:12,002 INFO L480 AbstractCegarLoop]: Abstraction has 1132 states and 1226 transitions. [2018-12-03 15:34:12,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:34:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1226 transitions. [2018-12-03 15:34:12,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1132 [2018-12-03 15:34:12,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:12,010 INFO L402 BasicCegarLoop]: trace histogram [940, 94, 94, 1, 1, 1] [2018-12-03 15:34:12,010 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:12,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash 267171119, now seen corresponding path program 98 times [2018-12-03 15:34:12,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:12,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:12,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:12,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:12,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 15:34:16,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:16,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:16,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:16,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:16,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:16,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:16,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:16,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:21,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 565 check-sat command(s) [2018-12-03 15:34:21,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:21,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 15:34:22,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 538526 backedges. 0 proven. 533356 refuted. 0 times theorem prover too weak. 5170 trivial. 0 not checked. [2018-12-03 15:34:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:32,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 15:34:32,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:32,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:34:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:34:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:34:32,872 INFO L87 Difference]: Start difference. First operand 1132 states and 1226 transitions. Second operand 97 states. [2018-12-03 15:34:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:35,158 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-12-03 15:34:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:34:35,158 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1131 [2018-12-03 15:34:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:35,159 INFO L225 Difference]: With dead ends: 1157 [2018-12-03 15:34:35,160 INFO L226 Difference]: Without dead ends: 1155 [2018-12-03 15:34:35,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2356 GetRequests, 2166 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:34:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-12-03 15:34:36,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1144. [2018-12-03 15:34:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2018-12-03 15:34:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1239 transitions. [2018-12-03 15:34:36,557 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1239 transitions. Word has length 1131 [2018-12-03 15:34:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:36,558 INFO L480 AbstractCegarLoop]: Abstraction has 1144 states and 1239 transitions. [2018-12-03 15:34:36,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:34:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1239 transitions. [2018-12-03 15:34:36,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2018-12-03 15:34:36,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:36,568 INFO L402 BasicCegarLoop]: trace histogram [950, 95, 95, 1, 1, 1] [2018-12-03 15:34:36,568 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:36,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:36,569 INFO L82 PathProgramCache]: Analyzing trace with hash -844977543, now seen corresponding path program 99 times [2018-12-03 15:34:36,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:36,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:36,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:36,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-12-03 15:34:41,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:41,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:41,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:41,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 15:34:41,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:41,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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:41,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:41,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:41,974 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:41,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:41,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:42,941 INFO L134 CoverageAnalysis]: Checked inductivity of 550050 backedges. 0 proven. 544825 refuted. 0 times theorem prover too weak. 5225 trivial. 0 not checked. [2018-12-03 15:34:42,942 INFO L316 TraceCheckSpWp]: Computing backward predicates...