java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:26:08,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:26:08,311 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:26:08,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:26:08,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:26:08,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:26:08,330 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:26:08,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:26:08,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:26:08,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:26:08,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:26:08,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:26:08,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:26:08,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:26:08,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:26:08,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:26:08,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:26:08,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:26:08,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:26:08,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:26:08,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:26:08,347 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:26:08,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:26:08,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:26:08,350 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:26:08,351 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:26:08,352 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:26:08,353 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:26:08,354 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:26:08,355 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:26:08,355 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:26:08,356 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:26:08,356 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:26:08,356 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:26:08,360 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:26:08,361 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:26:08,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:26:08,384 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:26:08,385 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:26:08,386 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:26:08,386 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:26:08,386 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:26:08,386 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:26:08,386 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:26:08,387 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:26:08,387 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:26:08,387 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:26:08,387 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:26:08,387 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:26:08,387 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:26:08,388 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:26:08,388 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:26:08,388 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:26:08,389 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:26:08,389 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:26:08,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:26:08,390 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:26:08,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:26:08,390 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:26:08,390 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:26:08,390 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:26:08,392 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:26:08,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:26:08,392 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:26:08,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:26:08,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:26:08,393 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:26:08,393 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:26:08,393 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:26:08,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:26:08,394 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:26:08,394 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:26:08,394 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:26:08,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:26:08,394 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:26:08,395 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:26:08,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:26:08,446 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:26:08,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:26:08,453 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:26:08,453 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:26:08,454 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 17:26:08,454 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 17:26:08,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:26:08,489 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:26:08,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:26:08,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:26:08,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:26:08,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:26:08,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:26:08,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:26:08,528 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:26:08,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/1) ... [2018-12-03 17:26:08,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:26:08,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:26:08,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:26:08,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:26:08,556 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (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 17:26:08,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:26:08,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:26:08,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:26:08,820 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:26:08,820 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:26:08,821 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:26:08 BoogieIcfgContainer [2018-12-03 17:26:08,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:26:08,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:26:08,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:26:08,825 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:26:08,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:26:08" (1/2) ... [2018-12-03 17:26:08,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2728cfe and model type count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:26:08, skipping insertion in model container [2018-12-03 17:26:08,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:26:08" (2/2) ... [2018-12-03 17:26:08,829 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 17:26:08,839 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:26:08,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:26:08,865 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:26:08,900 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:26:08,900 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:26:08,901 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:26:08,901 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:26:08,901 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:26:08,901 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:26:08,901 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:26:08,902 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:26:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:26:08,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:26:08,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:08,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:26:08,928 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:08,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-12-03 17:26:08,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:08,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:08,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:08,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:08,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:09,123 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 17:26:09,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:26:09,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:26:09,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:26:09,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:26:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:26:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:26:09,150 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 17:26:09,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:09,214 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:26:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:26:09,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:26:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:09,228 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:26:09,228 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 17:26:09,232 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 17:26:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 17:26:09,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 17:26:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 17:26:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 17:26:09,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 17:26:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:09,266 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 17:26:09,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:26:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 17:26:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:26:09,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:09,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:26:09,268 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:09,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:09,268 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-12-03 17:26:09,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:09,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:09,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:09,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:09,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:09,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:09,402 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 17:26:09,407 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 17:26:09,499 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:26:09,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:26:09,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:26:09,998 INFO L272 AbstractInterpreter]: Visited 4 different actions 30 times. Merged at 3 different actions 19 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:26:10,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:10,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:26:10,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:10,033 INFO 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 17:26:10,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:10,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:10,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:10,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:10,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:10,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:26:10,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:10,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:26:10,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:26:10,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:26:10,193 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 17:26:10,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:10,218 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 17:26:10,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:26:10,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 17:26:10,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:10,219 INFO L225 Difference]: With dead ends: 8 [2018-12-03 17:26:10,219 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 17:26:10,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:26:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 17:26:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 17:26:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:26:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:26:10,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 17:26:10,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:10,223 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:26:10,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:26:10,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:26:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:26:10,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:10,224 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 17:26:10,224 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:10,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-12-03 17:26:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:10,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:10,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:10,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:10,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:10,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:10,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:10,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:10,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:10,322 INFO 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 17:26:10,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:10,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:10,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:26:10,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:10,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:10,366 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:10,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:10,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:10,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:26:10,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:10,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:26:10,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:26:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:26:10,547 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 17:26:10,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:10,586 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 17:26:10,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:26:10,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:26:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:10,588 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:26:10,588 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:26:10,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:26:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:26:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:26:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:26:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:26:10,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 17:26:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:10,592 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:26:10,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:26:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:26:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:26:10,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:10,593 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 17:26:10,593 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:10,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-12-03 17:26:10,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:10,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:10,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:10,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:10,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:10,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:10,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:10,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:10,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:10,822 INFO 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 17:26:10,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:10,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:10,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:10,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:10,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:10,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:11,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:11,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 17:26:11,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:11,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:26:11,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:26:11,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:26:11,082 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 17:26:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:11,112 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:26:11,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:26:11,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 17:26:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:11,113 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:26:11,114 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 17:26:11,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:26:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 17:26:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 17:26:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:26:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 17:26:11,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 17:26:11,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:11,117 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 17:26:11,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:26:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 17:26:11,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:26:11,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:11,118 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 17:26:11,119 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:11,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:11,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-12-03 17:26:11,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:11,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:11,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:11,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:11,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:11,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:11,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:11,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:11,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:11,376 INFO 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 17:26:11,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:11,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:11,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:11,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:11,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:11,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:26:11,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:11,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:26:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:26:11,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:26:11,527 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 17:26:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:11,567 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 17:26:11,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:26:11,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 17:26:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:11,569 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:26:11,569 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:26:11,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:26:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:26:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:26:11,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:26:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:26:11,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 17:26:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:11,573 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:26:11,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:26:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:26:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:26:11,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:11,574 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 17:26:11,574 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:11,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:11,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-12-03 17:26:11,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:11,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:11,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:11,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:11,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:11,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:11,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:11,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:11,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:11,728 INFO 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 17:26:11,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:11,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:11,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:26:11,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:11,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:11,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:12,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:12,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 17:26:12,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:12,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:26:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:26:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:26:12,178 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 17:26:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:12,209 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 17:26:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:26:12,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:26:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:12,210 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:26:12,211 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:26:12,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:26:12,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:26:12,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 17:26:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:26:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 17:26:12,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 17:26:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:12,214 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 17:26:12,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:26:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 17:26:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:26:12,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:12,214 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 17:26:12,215 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:12,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:12,215 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-12-03 17:26:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:12,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:12,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:12,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:12,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:12,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:12,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:12,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 17:26:12,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:12,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 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 17:26:12,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:12,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:12,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:12,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:12,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:12,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:12,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:12,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 17:26:12,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:12,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:26:12,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:26:12,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:26:12,639 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 17:26:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:12,677 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 17:26:12,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:26:12,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:26:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:12,679 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:26:12,679 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:26:12,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:26:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:26:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:26:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:26:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 17:26:12,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 17:26:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:12,683 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 17:26:12,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:26:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 17:26:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:26:12,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:12,684 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 17:26:12,684 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:12,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-12-03 17:26:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:12,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:12,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:12,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:12,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:12,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:12,853 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:12,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:12,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:12,853 INFO 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 17:26:12,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:12,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:12,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:12,896 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:12,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:13,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:13,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:26:13,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:13,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:26:13,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:26:13,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:26:13,187 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 17:26:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:13,250 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:26:13,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:26:13,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 17:26:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:13,254 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:26:13,254 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 17:26:13,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:26:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 17:26:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 17:26:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:26:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 17:26:13,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 17:26:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:13,258 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 17:26:13,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:26:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 17:26:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:26:13,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:13,258 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 17:26:13,259 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:13,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:13,259 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-12-03 17:26:13,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:13,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:13,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:13,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:13,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:13,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:13,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:13,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:26:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:13,454 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:13,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:26:13,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:13,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:13,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:13,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:13,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:26:13,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:13,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:26:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:26:13,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:26:13,728 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 17:26:13,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:13,754 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 17:26:13,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:26:13,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:26:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:13,755 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:26:13,755 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:26:13,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 17:26:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:26:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:26:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:26:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:26:13,758 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 17:26:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:13,759 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:26:13,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:26:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:26:13,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:26:13,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:13,759 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:26:13,760 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:13,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:13,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-12-03 17:26:13,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:13,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:13,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:13,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:13,761 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:13,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:13,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:13,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:13,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:13,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:13,912 INFO 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 17:26:13,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:13,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:13,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:13,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:13,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:13,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:14,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:14,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:26:14,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:14,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:26:14,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:26:14,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:26:14,241 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 17:26:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:14,294 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 17:26:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:26:14,295 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:26:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:14,296 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:26:14,296 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 17:26:14,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:26:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 17:26:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 17:26:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:26:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 17:26:14,301 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 17:26:14,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:14,301 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 17:26:14,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:26:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 17:26:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:26:14,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:14,302 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 17:26:14,302 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:14,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:14,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-12-03 17:26:14,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:14,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:14,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:14,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:14,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:14,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:14,596 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:14,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:14,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:14,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:26:14,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:14,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:14,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:14,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:15,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:15,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:26:15,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:15,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:26:15,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:26:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:26:15,070 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 17:26:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:15,096 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 17:26:15,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:26:15,097 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 17:26:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:15,098 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:26:15,098 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:26:15,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:26:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:26:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:26:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:26:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 17:26:15,103 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 17:26:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:15,103 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 17:26:15,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:26:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 17:26:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:26:15,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:15,104 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 17:26:15,104 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:15,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-12-03 17:26:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:15,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:15,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:15,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:15,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:15,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:15,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:15,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:15,600 INFO 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 17:26:15,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:15,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:15,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:26:15,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:15,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:15,648 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:15,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:16,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:16,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 17:26:16,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:16,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:26:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:26:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:26:16,025 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 17:26:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:16,059 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 17:26:16,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:26:16,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 17:26:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:16,060 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:26:16,060 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 17:26:16,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:26:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 17:26:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 17:26:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:26:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 17:26:16,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 17:26:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:16,065 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 17:26:16,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:26:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 17:26:16,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:26:16,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:16,066 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 17:26:16,066 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:16,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:16,067 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-12-03 17:26:16,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:16,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:16,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:16,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:16,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:16,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:16,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:16,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:16,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:16,246 INFO 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 17:26:16,258 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:16,258 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:16,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:16,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:16,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:16,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:16,802 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:16,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:16,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:26:16,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:16,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:26:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:26:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:26:16,825 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 17:26:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:16,892 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 17:26:16,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:26:16,896 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 17:26:16,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:16,897 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:26:16,897 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:26:16,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:26:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:26:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:26:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:26:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 17:26:16,901 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 17:26:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:16,902 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 17:26:16,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:26:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 17:26:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:26:16,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:16,908 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 17:26:16,908 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:16,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-12-03 17:26:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:16,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:16,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:16,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:16,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:16,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:17,316 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:17,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:17,317 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:17,317 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:17,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:17,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:17,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:26:17,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:17,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:17,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:17,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:17,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:17,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:26:17,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:17,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:26:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:26:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:26:17,837 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 17:26:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:17,872 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 17:26:17,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:26:17,876 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 17:26:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:17,876 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:26:17,876 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:26:17,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:26:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:26:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:26:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:26:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 17:26:17,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 17:26:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:17,881 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 17:26:17,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:26:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 17:26:17,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:26:17,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:17,882 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 17:26:17,882 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:17,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-12-03 17:26:17,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:17,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:17,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:17,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:17,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:18,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:18,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:18,084 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:18,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 17:26:18,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:18,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 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 17:26:18,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:18,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:18,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:26:18,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:18,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:18,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:18,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:18,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 17:26:18,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:18,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:26:18,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:26:18,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:26:18,535 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 17:26:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:18,570 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 17:26:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:26:18,570 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 17:26:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:18,571 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:26:18,572 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:26:18,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:26:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:26:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:26:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:26:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 17:26:18,576 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 17:26:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:18,576 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 17:26:18,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:26:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 17:26:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:26:18,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:18,577 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 17:26:18,577 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:18,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-12-03 17:26:18,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:18,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:18,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:18,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:19,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:19,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:19,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:19,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 17:26:19,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:19,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 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 17:26:19,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:19,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:19,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:19,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:19,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:19,049 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:19,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:19,944 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:19,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:19,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:26:19,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:19,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:26:19,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:26:19,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:26:19,966 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 17:26:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:20,010 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 17:26:20,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:26:20,010 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:26:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:20,011 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:26:20,011 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:26:20,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:26:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:26:20,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:26:20,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:26:20,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 17:26:20,016 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 17:26:20,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:20,016 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 17:26:20,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:26:20,016 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 17:26:20,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:26:20,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:20,017 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 17:26:20,017 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:20,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:20,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-12-03 17:26:20,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:20,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:20,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:20,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:20,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:20,728 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:20,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:20,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:20,728 INFO 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 17:26:20,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:20,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:20,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:20,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:21,517 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:21,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:21,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:26:21,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:21,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:26:21,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:26:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:26:21,538 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 17:26:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:21,567 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 17:26:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:26:21,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 17:26:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:21,569 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:26:21,569 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:26:21,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:26:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:26:21,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:26:21,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:26:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:26:21,573 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 17:26:21,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:21,573 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:26:21,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:26:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:26:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:26:21,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:21,574 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 17:26:21,574 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:21,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:21,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-12-03 17:26:21,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:21,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:21,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:22,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:22,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:22,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:22,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:22,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:22,353 INFO 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 17:26:22,362 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:22,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:22,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:26:22,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:22,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:22,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:23,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:23,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 17:26:23,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:23,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:26:23,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:26:23,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:26:23,285 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 17:26:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:23,313 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 17:26:23,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:26:23,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 17:26:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:23,315 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:26:23,315 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:26:23,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:26:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:26:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:26:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:26:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 17:26:23,320 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 17:26:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:23,321 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 17:26:23,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:26:23,321 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 17:26:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:26:23,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:23,321 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 17:26:23,322 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:23,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:23,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-12-03 17:26:23,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:23,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:23,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:23,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:23,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:24,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:24,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:24,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:24,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:24,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:24,246 INFO 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 17:26:24,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:24,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:24,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:24,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:24,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:24,294 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:24,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:25,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:26:25,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:25,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:26:25,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:26:25,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:26:25,289 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 17:26:25,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:25,346 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 17:26:25,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:26:25,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 17:26:25,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:25,347 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:26:25,347 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:26:25,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:26:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:26:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:26:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:26:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 17:26:25,352 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 17:26:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:25,353 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 17:26:25,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:26:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 17:26:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:26:25,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:25,354 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 17:26:25,354 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:25,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-12-03 17:26:25,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:25,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:25,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:25,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:25,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:25,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:25,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:25,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:25,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:25,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:25,734 INFO 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 17:26:25,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:25,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:25,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:25,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:26,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:26,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:26:26,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:26,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:26:26,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:26:26,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:26:26,272 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 17:26:26,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:26,320 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 17:26:26,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:26:26,321 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 17:26:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:26,321 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:26:26,321 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:26:26,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:26:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:26:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 17:26:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:26:26,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 17:26:26,325 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 17:26:26,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:26,326 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 17:26:26,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:26:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 17:26:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:26:26,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:26,326 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 17:26:26,327 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:26,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-12-03 17:26:26,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:26,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:26,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:26,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:26,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:26,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:26,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:26,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:26,562 INFO 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 17:26:26,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:26,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:26,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:26:26,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:26,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:26,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:27,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:27,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 17:26:27,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:27,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:26:27,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:26:27,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:26:27,178 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 17:26:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:27,228 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 17:26:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:26:27,228 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 17:26:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:27,229 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:26:27,229 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:26:27,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:26:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:26:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:26:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:26:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 17:26:27,234 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 17:26:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:27,234 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 17:26:27,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:26:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 17:26:27,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:26:27,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:27,235 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 17:26:27,242 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:27,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-12-03 17:26:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:27,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:27,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:27,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:27,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:27,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:27,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:27,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:27,551 INFO 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 17:26:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:27,559 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:27,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:27,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:27,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:27,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:28,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:26:28,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:28,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:26:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:26:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:26:28,299 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 17:26:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:28,374 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 17:26:28,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:26:28,378 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 17:26:28,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:28,378 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:26:28,378 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:26:28,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:26:28,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:26:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:26:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:26:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 17:26:28,383 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 17:26:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:28,383 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 17:26:28,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:26:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 17:26:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:26:28,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:28,384 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 17:26:28,384 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:28,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-12-03 17:26:28,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:28,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:28,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:28,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:28,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:28,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:28,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:28,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:28,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:28,718 INFO 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 17:26:28,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:28,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:28,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:28,772 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:28,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:29,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:29,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:26:29,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:29,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:26:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:26:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:26:29,608 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 17:26:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:29,651 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 17:26:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:26:29,652 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 17:26:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:29,652 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:26:29,652 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:26:29,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:26:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:26:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:26:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:26:29,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 17:26:29,656 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 17:26:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:29,657 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 17:26:29,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:26:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 17:26:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:26:29,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:29,658 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 17:26:29,658 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:29,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-12-03 17:26:29,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:29,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:29,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:29,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:30,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:30,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:30,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:30,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:30,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:30,295 INFO 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 17:26:30,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:30,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:30,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:26:30,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:30,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:30,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:31,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:31,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 17:26:31,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:31,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:26:31,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:26:31,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:26:31,151 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 17:26:31,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:31,205 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 17:26:31,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:26:31,206 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 17:26:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:31,206 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:26:31,206 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:26:31,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:26:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:26:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:26:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:26:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 17:26:31,212 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 17:26:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:31,212 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 17:26:31,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:26:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 17:26:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:26:31,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:31,214 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 17:26:31,214 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:31,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-12-03 17:26:31,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:31,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:31,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:31,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:31,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:31,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:31,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:31,838 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:31,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:31,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:31,839 INFO 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 17:26:31,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:31,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:31,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:31,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:31,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:31,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:32,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:32,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:26:32,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:32,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:26:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:26:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:26:32,570 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 17:26:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:32,648 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 17:26:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:26:32,649 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 17:26:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:32,649 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:26:32,650 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:26:32,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:26:32,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:26:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:26:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:26:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 17:26:32,655 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 17:26:32,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:32,655 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 17:26:32,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:26:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 17:26:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:26:32,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:32,656 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 17:26:32,656 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:32,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:32,657 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-12-03 17:26:32,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:32,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:32,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:32,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:32,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:33,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:33,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:33,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:33,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:33,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:33,014 INFO 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 17:26:33,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:33,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:33,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:33,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:34,329 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:34,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:34,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 17:26:34,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:34,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:26:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:26:34,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:26:34,351 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 17:26:34,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:34,457 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 17:26:34,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:26:34,458 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 17:26:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:34,458 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:26:34,458 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:26:34,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:26:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:26:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 17:26:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:26:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 17:26:34,463 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 17:26:34,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:34,463 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 17:26:34,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:26:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 17:26:34,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:26:34,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:34,464 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 17:26:34,464 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:34,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-12-03 17:26:34,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:34,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:34,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:34,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:34,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:35,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:35,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:35,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:35,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:35,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:35,485 INFO 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 17:26:35,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:35,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:35,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:26:35,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:35,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:35,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:36,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:36,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 17:26:36,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:36,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:26:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:26:36,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:26:36,461 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 17:26:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:36,691 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 17:26:36,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:26:36,691 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 17:26:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:36,691 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:26:36,692 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:26:36,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:26:36,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:26:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:26:36,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:26:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 17:26:36,696 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 17:26:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:36,696 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 17:26:36,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:26:36,696 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 17:26:36,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:26:36,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:36,697 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 17:26:36,697 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:36,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:36,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-12-03 17:26:36,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:36,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:36,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:36,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:37,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:37,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:37,269 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:37,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:37,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:37,269 INFO 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 17:26:37,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:37,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:37,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:37,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:37,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:37,331 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:37,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:38,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:38,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 17:26:38,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:38,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:26:38,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:26:38,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:26:38,270 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 17:26:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:38,314 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 17:26:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:26:38,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 17:26:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:38,315 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:26:38,315 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:26:38,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:26:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:26:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 17:26:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:26:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 17:26:38,320 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 17:26:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:38,321 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 17:26:38,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:26:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 17:26:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:26:38,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:38,321 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 17:26:38,322 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:38,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:38,322 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-12-03 17:26:38,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:38,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:38,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:38,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:39,368 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:39,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:39,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:39,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:39,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:39,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:39,369 INFO 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 17:26:39,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:39,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:39,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:39,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:40,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:40,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 17:26:40,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:40,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:26:40,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:26:40,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:26:40,756 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 17:26:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:40,834 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 17:26:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:26:40,835 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 17:26:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:40,835 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:26:40,836 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:26:40,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:26:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:26:40,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:26:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:26:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 17:26:40,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 17:26:40,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:40,841 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 17:26:40,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:26:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 17:26:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:26:40,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:40,844 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 17:26:40,844 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:40,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:40,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-12-03 17:26:40,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:40,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:40,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:40,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:40,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:41,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:41,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:41,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:41,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:41,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:41,292 INFO 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 17:26:41,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:41,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:41,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:26:41,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:41,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:41,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:42,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:42,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 17:26:42,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:42,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:26:42,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:26:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:26:42,728 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 17:26:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:42,780 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 17:26:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:26:42,781 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 17:26:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:42,781 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:26:42,781 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:26:42,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:26:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:26:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 17:26:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 17:26:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 17:26:42,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 17:26:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:42,784 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 17:26:42,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:26:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 17:26:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 17:26:42,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:42,785 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 17:26:42,785 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:42,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-12-03 17:26:42,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:42,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:42,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:42,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:43,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:43,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:43,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:43,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:43,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:43,281 INFO 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 17:26:43,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:43,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:43,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:43,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:43,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:43,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:44,375 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:44,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 17:26:44,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:44,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:26:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:26:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:26:44,396 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 17:26:44,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:44,452 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 17:26:44,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:26:44,453 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 17:26:44,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:44,453 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:26:44,454 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:26:44,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:26:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:26:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 17:26:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:26:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 17:26:44,456 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 17:26:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:44,456 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 17:26:44,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:26:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 17:26:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:26:44,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:44,457 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 17:26:44,457 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:44,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-12-03 17:26:44,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:44,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:44,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:44,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:45,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:45,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:45,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:45,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:45,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:45,314 INFO 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 17:26:45,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:45,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:45,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:45,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:46,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:46,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 17:26:46,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:46,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:26:46,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:26:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:26:46,809 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 17:26:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:46,874 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 17:26:46,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:26:46,875 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 17:26:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:46,875 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:26:46,875 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:26:46,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:26:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:26:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 17:26:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:26:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 17:26:46,880 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 17:26:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:46,880 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 17:26:46,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:26:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 17:26:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:26:46,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:46,881 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 17:26:46,881 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:46,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:46,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-12-03 17:26:46,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:46,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:46,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:46,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:46,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:47,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:47,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:47,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:47,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:47,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:47,443 INFO 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 17:26:47,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:47,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:47,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:26:47,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:47,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:47,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:48,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:48,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:26:48,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:48,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:26:48,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:26:48,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:26:48,697 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 17:26:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:48,764 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 17:26:48,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:26:48,764 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 17:26:48,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:48,765 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:26:48,765 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:26:48,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:26:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:26:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:26:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:26:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 17:26:48,769 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 17:26:48,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:48,769 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 17:26:48,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:26:48,769 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 17:26:48,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:26:48,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:48,770 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 17:26:48,770 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:48,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-12-03 17:26:48,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:48,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:48,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:48,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:49,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:49,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:49,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:49,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:49,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:49,455 INFO 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 17:26:49,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:49,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:49,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:49,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:49,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:49,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:51,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:51,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:26:51,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:51,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:26:51,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:26:51,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:26:51,126 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 17:26:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:51,229 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 17:26:51,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:26:51,230 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 17:26:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:51,231 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:26:51,231 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:26:51,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:26:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:26:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 17:26:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:26:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 17:26:51,234 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 17:26:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:51,234 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 17:26:51,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:26:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 17:26:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 17:26:51,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:51,234 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 17:26:51,235 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:51,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:51,235 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-12-03 17:26:51,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:51,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:51,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:51,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:51,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:52,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:52,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:52,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:52,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:52,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:52,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:26:52,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:52,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:26:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:52,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:52,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:53,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:53,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:26:53,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:53,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:26:53,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:26:53,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:26:53,975 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 17:26:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:54,024 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 17:26:54,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:26:54,025 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 17:26:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:54,026 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:26:54,026 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:26:54,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:26:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:26:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:26:54,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:26:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 17:26:54,029 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 17:26:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:54,029 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 17:26:54,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:26:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 17:26:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:26:54,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:54,030 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 17:26:54,030 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:54,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:54,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-12-03 17:26:54,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:54,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:54,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:26:54,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:54,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:55,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:55,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:55,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:55,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:55,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:55,229 INFO 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 17:26:55,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:26:55,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:26:55,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:26:55,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:55,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:55,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:57,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:57,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:26:57,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:57,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:26:57,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:26:57,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:26:57,066 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 17:26:57,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:57,116 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 17:26:57,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:26:57,116 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 17:26:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:57,117 INFO L225 Difference]: With dead ends: 42 [2018-12-03 17:26:57,117 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:26:57,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:26:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:26:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:26:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:26:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 17:26:57,120 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 17:26:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:57,121 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 17:26:57,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:26:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 17:26:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:26:57,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:57,121 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 17:26:57,121 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:57,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-12-03 17:26:57,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:57,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:57,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:26:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:57,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:57,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:26:57,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:26:57,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:26:57,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:26:57,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:26:57,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:26:57,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:26:57,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:26:57,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:26:57,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:26:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:57,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:26:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:26:59,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:26:59,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:26:59,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:26:59,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:26:59,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:26:59,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:26:59,618 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 17:26:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:26:59,672 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 17:26:59,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:26:59,673 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 17:26:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:26:59,674 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:26:59,674 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:26:59,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:26:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:26:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:26:59,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:26:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 17:26:59,677 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 17:26:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:26:59,677 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 17:26:59,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:26:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 17:26:59,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:26:59,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:26:59,678 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 17:26:59,678 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:26:59,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:26:59,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-12-03 17:26:59,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:26:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:59,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:26:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:26:59,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:26:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:00,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:00,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:00,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:00,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:00,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:00,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:27:00,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:00,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:00,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:00,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:02,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:02,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:27:02,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:02,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:27:02,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:27:02,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:27:02,193 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 17:27:02,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:02,270 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 17:27:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:27:02,270 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 17:27:02,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:02,271 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:27:02,271 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:27:02,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:27:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:27:02,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:27:02,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:27:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 17:27:02,274 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 17:27:02,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:02,275 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 17:27:02,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:27:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 17:27:02,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:27:02,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:02,276 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 17:27:02,276 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:02,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:02,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-12-03 17:27:02,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:02,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:02,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:02,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:03,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:03,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:03,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:03,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:03,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:03,037 INFO 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 17:27:03,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:03,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:03,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:27:03,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:03,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:03,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:05,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:05,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:27:05,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:05,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:27:05,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:27:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:27:05,080 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 17:27:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:05,140 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 17:27:05,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:27:05,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 17:27:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:05,141 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:27:05,141 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:27:05,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:27:05,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:27:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:27:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:27:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 17:27:05,144 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 17:27:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:05,144 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 17:27:05,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:27:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 17:27:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:27:05,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:05,145 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 17:27:05,145 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:05,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-12-03 17:27:05,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:05,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:05,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:06,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:06,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:06,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:06,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:06,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:06,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:27:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:06,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:06,237 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:06,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:06,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:06,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:07,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:27:07,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:07,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:27:07,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:27:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:27:07,999 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 17:27:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:08,071 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 17:27:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:27:08,071 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 17:27:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:08,072 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:27:08,072 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:27:08,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 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 17:27:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:27:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:27:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:27:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 17:27:08,076 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 17:27:08,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:08,076 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 17:27:08,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:27:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 17:27:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:27:08,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:08,076 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 17:27:08,077 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:08,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-12-03 17:27:08,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:08,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:08,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:09,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:09,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:09,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:09,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 17:27:09,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:09,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 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 17:27:09,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:09,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:09,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:09,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:11,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:11,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:27:11,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:11,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:27:11,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:27:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:27:11,251 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 17:27:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:11,351 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 17:27:11,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:27:11,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 17:27:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:11,353 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:27:11,353 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:27:11,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:27:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:27:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:27:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:27:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 17:27:11,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 17:27:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:11,356 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 17:27:11,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:27:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 17:27:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:27:11,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:11,356 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 17:27:11,356 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:11,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-12-03 17:27:11,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:11,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:11,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:12,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:12,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:12,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:12,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:12,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:12,357 INFO 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 17:27:12,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:12,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:12,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:27:12,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:12,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:12,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:14,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:14,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:27:14,510 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:14,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:27:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:27:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:27:14,511 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 17:27:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:14,583 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 17:27:14,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:27:14,584 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 17:27:14,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:14,584 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:27:14,585 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 17:27:14,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:27:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 17:27:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 17:27:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:27:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 17:27:14,588 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 17:27:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:14,588 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 17:27:14,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:27:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 17:27:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:27:14,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:14,588 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 17:27:14,589 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:14,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:14,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-12-03 17:27:14,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:14,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:14,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:15,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:15,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:15,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:15,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:15,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:15,528 INFO 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 17:27:15,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:15,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:15,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:15,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:15,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:15,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:18,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:18,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:27:18,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:18,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:27:18,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:27:18,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:27:18,101 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 17:27:18,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:18,153 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 17:27:18,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:27:18,154 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 17:27:18,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:18,154 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:27:18,154 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:27:18,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:27:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:27:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:27:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:27:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 17:27:18,158 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 17:27:18,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:18,159 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 17:27:18,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:27:18,159 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 17:27:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:27:18,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:18,160 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 17:27:18,160 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:18,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:18,160 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-12-03 17:27:18,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:18,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:18,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:18,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:18,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:18,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:18,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:18,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:18,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:18,982 INFO 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 17:27:18,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:18,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:19,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:19,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:21,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:21,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:27:21,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:21,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:27:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:27:21,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:27:21,601 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 17:27:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:21,687 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 17:27:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:27:21,687 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 17:27:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:21,688 INFO L225 Difference]: With dead ends: 50 [2018-12-03 17:27:21,688 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 17:27:21,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:27:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 17:27:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 17:27:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:27:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 17:27:21,691 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 17:27:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:21,692 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 17:27:21,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:27:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 17:27:21,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:27:21,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:21,693 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 17:27:21,693 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:21,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-12-03 17:27:21,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:21,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:22,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:22,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:22,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:22,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:22,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:22,529 INFO 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 17:27:22,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:22,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:22,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:27:22,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:22,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:22,624 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:22,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:24,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:24,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:27:24,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:24,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:27:24,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:27:24,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:27:24,852 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 17:27:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:24,989 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 17:27:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:27:24,989 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 17:27:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:24,990 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:27:24,990 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:27:24,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:27:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:27:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:27:24,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:27:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 17:27:24,994 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 17:27:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:24,994 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 17:27:24,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:27:24,995 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 17:27:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:27:24,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:24,995 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 17:27:24,995 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:24,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:24,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-12-03 17:27:24,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:24,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:24,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:24,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:26,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:26,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:26,072 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:26,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:26,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:26,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:27:26,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:26,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:26,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:26,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:26,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:26,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:28,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:28,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:27:28,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:28,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:27:28,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:27:28,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:27:28,894 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 17:27:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:29,243 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 17:27:29,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:27:29,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 17:27:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:29,245 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:27:29,245 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:27:29,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:27:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:27:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:27:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:27:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 17:27:29,249 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 17:27:29,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:29,249 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 17:27:29,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:27:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 17:27:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:27:29,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:29,250 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 17:27:29,250 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:29,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:29,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-12-03 17:27:29,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:29,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:29,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:30,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:30,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:30,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:30,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:30,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:30,298 INFO 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 17:27:30,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:30,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:30,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:30,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:33,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:33,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:27:33,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:27:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:27:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:27:33,112 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 17:27:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:33,197 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 17:27:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:27:33,198 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 17:27:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:33,199 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:27:33,199 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:27:33,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:27:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:27:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:27:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:27:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 17:27:33,203 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 17:27:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:33,203 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 17:27:33,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:27:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 17:27:33,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:27:33,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:33,204 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 17:27:33,204 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:33,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-12-03 17:27:33,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:33,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:33,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:33,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:34,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:34,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:34,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:34,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 17:27:34,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:34,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 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 17:27:34,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:34,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:34,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:27:34,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:34,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:34,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:37,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:37,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:27:37,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:37,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:27:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:27:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:27:37,167 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 17:27:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:37,227 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 17:27:37,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:27:37,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 17:27:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:37,229 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:27:37,229 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:27:37,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:27:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:27:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:27:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:27:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 17:27:37,232 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 17:27:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:37,233 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 17:27:37,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:27:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 17:27:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:27:37,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:37,233 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 17:27:37,234 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:37,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-12-03 17:27:37,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:37,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:37,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:38,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:38,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:38,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:38,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:38,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:38,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:38,271 INFO 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 17:27:38,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:38,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:38,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:38,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:38,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:38,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:40,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:41,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:41,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:27:41,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:41,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:27:41,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:27:41,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:27:41,020 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 17:27:41,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:41,166 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 17:27:41,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:27:41,166 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 17:27:41,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:41,167 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:27:41,167 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:27:41,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:27:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:27:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:27:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:27:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 17:27:41,170 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 17:27:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:41,170 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 17:27:41,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:27:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 17:27:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:27:41,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:41,171 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 17:27:41,171 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:41,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-12-03 17:27:41,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:41,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:41,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:42,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:42,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:42,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:42,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:42,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:42,613 INFO 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 17:27:42,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:42,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:42,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:42,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:45,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:45,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:27:45,685 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:45,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:27:45,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:27:45,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:27:45,687 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 17:27:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:45,745 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 17:27:45,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:27:45,745 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 17:27:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:45,746 INFO L225 Difference]: With dead ends: 56 [2018-12-03 17:27:45,746 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:27:45,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:27:45,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:27:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 17:27:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:27:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 17:27:45,749 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 17:27:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:45,750 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 17:27:45,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:27:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 17:27:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:27:45,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:45,750 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 17:27:45,750 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:45,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-12-03 17:27:45,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:45,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:45,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:47,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:47,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:47,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:47,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:47,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:47,121 INFO 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 17:27:47,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:27:47,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:27:47,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:27:47,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:47,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:47,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:50,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:50,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:50,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 17:27:50,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:50,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:27:50,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:27:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:27:50,097 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 17:27:50,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:50,304 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 17:27:50,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:27:50,305 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 17:27:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:50,306 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:27:50,306 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:27:50,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:27:50,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:27:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 17:27:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:27:50,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 17:27:50,310 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 17:27:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:50,310 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 17:27:50,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:27:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 17:27:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:27:50,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:50,311 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 17:27:50,311 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:50,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-12-03 17:27:50,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:50,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:50,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:50,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:51,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:51,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:51,853 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:51,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:51,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:51,854 INFO 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 17:27:51,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:27:51,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:27:51,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:27:51,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:27:51,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:51,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:27:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:54,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:27:54,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 17:27:54,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:27:54,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:27:54,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:27:54,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:27:54,870 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 17:27:54,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:27:54,966 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 17:27:54,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:27:54,966 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 17:27:54,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:27:54,967 INFO L225 Difference]: With dead ends: 58 [2018-12-03 17:27:54,967 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 17:27:54,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:27:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 17:27:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 17:27:54,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:27:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 17:27:54,971 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 17:27:54,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:27:54,971 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 17:27:54,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:27:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 17:27:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:27:54,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:27:54,971 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 17:27:54,972 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:27:54,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:27:54,972 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-12-03 17:27:54,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:27:54,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:54,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:27:54,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:27:54,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:27:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:57,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:57,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:27:57,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:27:57,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:27:57,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:27:57,284 INFO 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 17:27:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:27:57,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:27:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:27:57,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:27:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:27:57,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:00,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:00,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 17:28:00,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:00,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:28:00,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:28:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:28:00,396 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 17:28:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:00,501 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 17:28:00,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:28:00,501 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 17:28:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:00,502 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:28:00,502 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:28:00,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:28:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:28:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 17:28:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:28:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 17:28:00,506 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 17:28:00,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:00,507 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 17:28:00,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:28:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 17:28:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:28:00,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:00,507 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 17:28:00,508 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:00,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-12-03 17:28:00,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:00,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:00,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:00,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:00,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:01,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:01,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:01,609 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:01,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:01,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:01,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:01,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:01,618 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:01,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:28:01,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:01,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:01,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:01,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:05,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:05,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:05,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 17:28:05,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:05,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:28:05,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:28:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:28:05,247 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 17:28:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:05,320 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 17:28:05,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:28:05,320 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 17:28:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:05,321 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:28:05,321 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:28:05,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 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 17:28:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:28:05,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 17:28:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:28:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 17:28:05,324 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 17:28:05,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:05,325 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 17:28:05,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:28:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 17:28:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:28:05,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:05,325 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 17:28:05,325 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:05,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-12-03 17:28:05,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:05,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:05,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:06,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:06,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:06,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:06,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:06,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:06,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:06,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:06,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:06,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:06,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:06,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:06,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:10,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 17:28:10,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:10,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:28:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:28:10,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:28:10,288 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 17:28:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:10,380 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 17:28:10,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:28:10,380 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 17:28:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:10,381 INFO L225 Difference]: With dead ends: 61 [2018-12-03 17:28:10,381 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:28:10,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:28:10,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:28:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 17:28:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:28:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 17:28:10,385 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 17:28:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:10,385 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 17:28:10,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:28:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 17:28:10,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:28:10,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:10,386 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 17:28:10,386 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:10,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:10,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-12-03 17:28:10,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:10,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:10,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:11,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:11,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:11,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:11,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:11,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:11,648 INFO 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 17:28:11,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:11,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:11,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:11,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:15,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:15,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 17:28:15,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:28:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:28:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:28:15,443 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 17:28:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:15,564 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 17:28:15,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:28:15,565 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 17:28:15,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:15,566 INFO L225 Difference]: With dead ends: 62 [2018-12-03 17:28:15,566 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:28:15,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:28:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:28:15,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 17:28:15,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:28:15,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 17:28:15,570 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 17:28:15,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:15,570 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 17:28:15,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:28:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 17:28:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:28:15,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:15,570 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 17:28:15,571 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:15,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:15,571 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-12-03 17:28:15,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:15,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:15,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:15,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:15,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:16,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:16,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:16,819 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:16,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:16,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:16,819 INFO 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 17:28:16,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:16,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:16,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 17:28:16,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:16,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:16,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:20,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:20,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 17:28:20,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:20,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:28:20,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:28:20,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:28:20,689 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 17:28:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:20,764 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 17:28:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:28:20,764 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 17:28:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:20,765 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:28:20,765 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:28:20,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:28:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:28:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:28:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:28:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 17:28:20,769 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 17:28:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:20,769 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 17:28:20,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:28:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 17:28:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:28:20,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:20,770 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 17:28:20,770 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:20,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-12-03 17:28:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:20,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:20,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:22,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:22,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:22,939 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:22,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:22,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:22,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:22,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:23,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:23,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:23,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:23,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:26,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 17:28:26,848 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:26,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:28:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:28:26,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:28:26,850 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 17:28:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:26,953 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 17:28:26,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:28:26,954 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 17:28:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:26,955 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:28:26,955 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:28:26,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:28:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:28:26,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 17:28:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:28:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 17:28:26,959 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 17:28:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:26,960 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 17:28:26,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:28:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 17:28:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 17:28:26,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:26,960 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 17:28:26,961 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:26,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-12-03 17:28:26,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:26,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:26,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:26,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:28,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:28,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:28,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:28,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:28,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:28,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:28,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:28,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:28,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:28,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:28,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:33,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:33,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 17:28:33,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:33,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:28:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:28:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:28:33,208 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 17:28:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:33,297 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 17:28:33,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:28:33,297 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 17:28:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:33,298 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:28:33,298 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:28:33,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:28:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:28:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 17:28:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:28:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 17:28:33,303 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 17:28:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:33,303 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 17:28:33,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:28:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 17:28:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:28:33,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:33,304 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 17:28:33,304 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-12-03 17:28:33,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:33,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:34,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:34,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:34,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:34,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:34,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:34,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:34,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 17:28:34,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:34,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:34,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:38,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:38,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 17:28:38,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:38,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:28:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:28:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:28:38,917 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 17:28:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:38,994 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 17:28:38,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:28:38,994 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 17:28:38,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:38,995 INFO L225 Difference]: With dead ends: 66 [2018-12-03 17:28:38,995 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 17:28:38,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:28:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 17:28:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 17:28:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:28:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 17:28:38,998 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 17:28:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:38,999 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 17:28:38,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:28:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 17:28:38,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:28:38,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:39,000 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 17:28:39,000 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:39,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-12-03 17:28:39,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:39,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:39,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:40,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:40,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:40,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:40,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:40,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:40,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 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 17:28:40,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:40,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:40,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:40,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:40,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:40,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:44,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 17:28:44,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:44,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:28:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:28:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:28:44,774 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 17:28:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:44,910 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 17:28:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:28:44,911 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 17:28:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:44,911 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:28:44,911 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:28:44,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:28:44,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:28:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 17:28:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:28:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 17:28:44,915 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 17:28:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:44,915 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 17:28:44,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:28:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 17:28:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:28:44,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:44,916 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 17:28:44,916 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:44,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:44,917 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-12-03 17:28:44,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:44,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:44,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:44,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:46,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:46,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:46,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:46,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:46,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:46,352 INFO 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 17:28:46,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:46,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:28:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:46,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:46,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:50,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:50,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 17:28:50,902 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:50,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:28:50,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:28:50,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:28:50,904 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 17:28:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:51,034 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 17:28:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:28:51,035 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 17:28:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:51,036 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:28:51,036 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:28:51,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:28:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:28:51,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 17:28:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:28:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 17:28:51,039 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 17:28:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:51,040 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 17:28:51,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:28:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 17:28:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:28:51,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:51,040 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 17:28:51,040 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:51,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:51,041 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-12-03 17:28:51,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:51,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:51,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:51,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:52,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:52,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:52,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:52,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:52,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:52,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:52,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:28:52,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:28:52,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:28:52,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:28:52,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:52,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:52,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:28:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:57,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:28:57,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 17:28:57,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:28:57,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:28:57,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:28:57,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:28:57,490 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 17:28:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:57,607 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 17:28:57,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:28:57,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 17:28:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:57,608 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:28:57,608 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:28:57,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:28:57,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:28:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 17:28:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:28:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 17:28:57,612 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 17:28:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:57,612 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 17:28:57,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:28:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 17:28:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:28:57,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:57,613 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 17:28:57,613 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:57,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-12-03 17:28:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:57,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:28:57,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:57,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:59,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:59,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:59,523 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:28:59,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:28:59,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:59,524 INFO 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 17:28:59,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:28:59,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:28:59,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:28:59,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:28:59,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:28:59,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:59,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:04,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:04,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 17:29:04,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:04,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:29:04,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:29:04,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:29:04,360 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 17:29:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:04,474 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 17:29:04,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:29:04,476 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 17:29:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:04,477 INFO L225 Difference]: With dead ends: 70 [2018-12-03 17:29:04,477 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:29:04,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:29:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:29:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 17:29:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:29:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 17:29:04,481 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 17:29:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:04,481 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 17:29:04,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:29:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 17:29:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:29:04,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:04,482 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 17:29:04,482 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:04,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-12-03 17:29:04,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:04,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:04,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:06,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:06,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:06,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:06,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,171 INFO 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 17:29:06,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:06,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:06,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:06,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:11,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:11,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 17:29:11,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:11,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:29:11,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:29:11,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:29:11,184 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 17:29:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:11,265 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 17:29:11,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:29:11,265 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 17:29:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:11,266 INFO L225 Difference]: With dead ends: 71 [2018-12-03 17:29:11,266 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:29:11,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 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 17:29:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:29:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:29:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:29:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 17:29:11,271 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 17:29:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:11,271 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 17:29:11,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:29:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 17:29:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:29:11,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:11,271 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 17:29:11,272 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:11,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-12-03 17:29:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:11,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:11,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:11,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:12,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:12,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:12,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:12,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:12,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:12,923 INFO 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 17:29:12,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:12,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:13,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:29:13,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:13,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:13,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:17,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:17,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:17,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 17:29:17,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:17,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:29:17,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:29:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:29:17,978 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 17:29:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:18,103 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 17:29:18,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:29:18,103 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 17:29:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:18,104 INFO L225 Difference]: With dead ends: 72 [2018-12-03 17:29:18,104 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 17:29:18,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:29:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 17:29:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 17:29:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:29:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 17:29:18,108 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 17:29:18,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:18,109 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 17:29:18,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:29:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 17:29:18,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:29:18,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:18,109 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 17:29:18,110 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:18,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-12-03 17:29:18,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:18,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:18,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:18,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:18,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:20,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:20,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:20,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:20,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:20,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:20,454 INFO 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 17:29:20,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:20,466 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:20,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:20,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:20,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:20,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:26,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 17:29:26,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:29:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:29:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:29:26,965 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 17:29:27,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:27,304 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 17:29:27,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:29:27,305 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 17:29:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:27,306 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:29:27,306 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:29:27,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:29:27,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:29:27,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 17:29:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 17:29:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 17:29:27,308 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 17:29:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:27,309 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 17:29:27,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:29:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 17:29:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 17:29:27,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:27,309 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 17:29:27,310 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:27,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:27,310 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-12-03 17:29:27,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:27,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:27,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:27,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:27,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:29,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:29,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:29,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:29,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:29,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:29,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:29,348 INFO 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 17:29:29,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:29,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:29,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:29,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:34,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:34,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 17:29:34,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:34,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:29:34,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:29:34,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:29:34,967 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 17:29:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:35,066 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 17:29:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:29:35,066 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 17:29:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:35,067 INFO L225 Difference]: With dead ends: 74 [2018-12-03 17:29:35,067 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 17:29:35,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:29:35,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 17:29:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 17:29:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:29:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 17:29:35,071 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 17:29:35,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:35,072 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 17:29:35,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:29:35,072 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 17:29:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:29:35,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:35,072 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 17:29:35,072 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:35,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-12-03 17:29:35,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:35,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:35,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:36,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:36,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:36,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:36,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 17:29:36,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:36,890 INFO 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 17:29:36,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:36,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:37,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 17:29:37,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:37,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:37,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:42,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:42,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 17:29:42,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:42,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:29:42,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:29:42,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:29:42,358 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 17:29:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:42,566 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 17:29:42,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:29:42,567 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 17:29:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:42,568 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:29:42,568 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:29:42,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:29:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:29:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 17:29:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:29:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 17:29:42,571 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 17:29:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:42,571 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 17:29:42,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:29:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 17:29:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:29:42,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:42,572 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 17:29:42,572 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:42,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:42,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-12-03 17:29:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:42,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:42,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:44,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:44,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:44,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:44,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:44,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:44,541 INFO 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 17:29:44,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:44,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:44,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:44,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:44,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:44,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:50,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:50,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 17:29:50,176 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:50,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:29:50,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:29:50,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:29:50,177 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 17:29:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:50,334 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 17:29:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:29:50,335 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 17:29:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:50,336 INFO L225 Difference]: With dead ends: 76 [2018-12-03 17:29:50,336 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:29:50,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 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 17:29:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:29:50,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 17:29:50,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:29:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 17:29:50,340 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 17:29:50,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:50,341 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 17:29:50,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:29:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 17:29:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:29:50,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:50,342 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 17:29:50,342 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:50,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-12-03 17:29:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:50,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:50,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:52,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:52,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:52,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:52,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:52,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:52,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:52,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:52,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:52,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:52,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:29:57,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:57,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 17:29:57,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:57,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:29:57,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:29:57,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:29:57,962 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 17:29:58,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:58,170 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 17:29:58,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:29:58,170 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 17:29:58,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:58,171 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:29:58,171 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:29:58,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:29:58,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:29:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 17:29:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:29:58,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 17:29:58,176 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 17:29:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:58,176 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 17:29:58,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:29:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 17:29:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:29:58,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:58,177 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 17:29:58,177 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:58,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-12-03 17:29:58,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:58,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:58,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:00,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:00,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:00,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:00,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 17:30:00,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:00,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 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 17:30:00,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:00,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:00,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 17:30:00,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:00,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:00,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:06,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:06,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 17:30:06,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:06,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:30:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:30:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:30:06,225 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 17:30:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:06,363 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 17:30:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:30:06,364 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 17:30:06,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:06,365 INFO L225 Difference]: With dead ends: 78 [2018-12-03 17:30:06,365 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 17:30:06,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 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 17:30:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 17:30:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 17:30:06,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:30:06,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 17:30:06,369 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 17:30:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:06,369 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 17:30:06,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:30:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 17:30:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:30:06,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:06,370 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 17:30:06,370 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:06,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-12-03 17:30:06,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:06,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:06,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:06,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:06,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:08,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:08,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:08,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:08,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:08,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:08,353 INFO 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 17:30:08,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:08,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:08,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:08,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:08,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:08,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:14,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:14,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 17:30:14,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:14,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:30:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:30:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:30:14,479 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 17:30:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:14,610 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 17:30:14,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:30:14,611 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 17:30:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:14,611 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:30:14,612 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:30:14,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 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 17:30:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:30:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:30:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:30:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 17:30:14,615 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 17:30:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:14,616 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 17:30:14,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:30:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 17:30:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:30:14,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:14,617 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 17:30:14,617 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:14,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:14,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-12-03 17:30:14,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:14,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:14,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:14,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:14,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:17,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:17,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:17,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:17,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:17,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:17,228 INFO 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 17:30:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:17,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:17,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:17,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:23,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:23,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 17:30:23,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:23,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:30:23,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:30:23,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:30:23,483 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 17:30:23,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:23,620 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 17:30:23,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:30:23,620 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 17:30:23,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:23,621 INFO L225 Difference]: With dead ends: 80 [2018-12-03 17:30:23,621 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 17:30:23,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:30:23,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 17:30:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 17:30:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:30:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 17:30:23,624 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 17:30:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:23,624 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 17:30:23,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:30:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 17:30:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:30:23,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:23,625 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 17:30:23,626 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:23,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-12-03 17:30:23,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:23,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:23,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:25,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:25,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:25,971 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:25,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:25,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:25,972 INFO 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 17:30:25,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:25,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:26,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:30:26,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:26,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:26,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:32,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:32,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 17:30:32,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:32,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:30:32,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:30:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:30:32,541 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 17:30:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:32,669 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 17:30:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:30:32,669 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 17:30:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:32,669 INFO L225 Difference]: With dead ends: 81 [2018-12-03 17:30:32,669 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 17:30:32,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:30:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 17:30:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 17:30:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:30:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 17:30:32,673 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 17:30:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:32,673 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 17:30:32,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:30:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 17:30:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 17:30:32,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:32,674 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 17:30:32,674 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:32,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-12-03 17:30:32,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:32,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:32,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:32,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:34,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:34,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:34,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:34,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:34,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:34,844 INFO 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 17:30:34,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:34,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:34,961 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:34,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:34,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:34,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:41,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:30:41,575 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:41,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:30:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:30:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:30:41,577 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 17:30:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:41,904 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 17:30:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:30:41,904 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 17:30:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:41,905 INFO L225 Difference]: With dead ends: 82 [2018-12-03 17:30:41,905 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:30:41,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:30:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:30:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 17:30:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:30:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 17:30:41,909 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 17:30:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:41,910 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 17:30:41,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:30:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 17:30:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:30:41,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:41,910 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 17:30:41,910 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:41,911 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-12-03 17:30:41,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:41,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:41,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:41,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:44,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:44,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:44,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:44,082 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:44,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:44,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:44,082 INFO 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 17:30:44,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:44,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:44,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:44,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:44,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:50,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:50,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:30:50,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:50,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:30:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:30:50,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:30:50,787 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 17:30:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:51,006 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 17:30:51,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:30:51,006 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 17:30:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:51,006 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:30:51,006 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:30:51,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:30:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:30:51,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 17:30:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:30:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 17:30:51,009 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 17:30:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:51,010 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 17:30:51,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:30:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 17:30:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:30:51,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:51,010 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 17:30:51,011 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:51,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:51,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-12-03 17:30:51,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:51,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:51,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:51,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:53,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:53,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:53,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:53,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:53,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:53,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:30:53,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:53,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:53,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:30:53,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:53,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:30:53,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:00,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:00,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:31:00,250 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:00,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:31:00,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:31:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:31:00,252 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 17:31:00,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:00,846 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 17:31:00,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:31:00,846 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 17:31:00,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:00,847 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:31:00,847 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:31:00,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 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 17:31:00,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:31:00,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:31:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:31:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 17:31:00,851 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 17:31:00,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:00,851 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 17:31:00,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:31:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 17:31:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:31:00,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:00,852 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 17:31:00,852 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:00,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-12-03 17:31:00,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:00,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:00,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:00,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:03,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:03,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:03,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:03,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:03,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:03,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:31:03,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:03,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:03,734 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:03,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:03,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:03,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:10,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:31:10,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:10,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:31:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:31:10,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:31:10,640 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 17:31:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:10,785 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 17:31:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:31:10,785 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 17:31:10,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:10,786 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:31:10,786 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:31:10,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:31:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:31:10,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:31:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:31:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 17:31:10,791 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 17:31:10,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:10,791 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 17:31:10,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:31:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 17:31:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:31:10,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:10,792 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 17:31:10,792 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:10,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:10,792 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-12-03 17:31:10,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:10,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:10,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:10,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:13,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:13,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:13,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:13,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:13,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:13,429 INFO 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 17:31:13,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:13,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:13,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:13,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:20,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:20,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:31:20,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:20,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:31:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:31:20,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:31:20,649 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 17:31:20,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:20,764 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 17:31:20,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:31:20,764 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 17:31:20,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:20,765 INFO L225 Difference]: With dead ends: 86 [2018-12-03 17:31:20,765 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:31:20,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:31:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:31:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:31:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:31:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 17:31:20,769 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 17:31:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:20,769 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 17:31:20,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:31:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 17:31:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:31:20,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:20,770 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 17:31:20,770 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:20,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-12-03 17:31:20,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:20,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:23,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:23,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:23,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:23,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:23,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:23,604 INFO 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 17:31:23,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:23,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:23,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 17:31:23,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:23,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:23,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:31,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:31,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:31:31,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:31,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:31:31,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:31:31,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:31:31,078 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 17:31:31,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:31,281 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 17:31:31,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:31:31,282 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 17:31:31,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:31,283 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:31:31,283 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:31:31,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:31:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:31:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:31:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:31:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 17:31:31,287 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 17:31:31,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:31,287 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 17:31:31,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:31:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 17:31:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:31:31,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:31,287 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 17:31:31,288 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:31,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-12-03 17:31:31,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:31,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:31,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:31,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:34,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:34,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:34,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:34,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:34,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:34,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:31:34,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:34,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:34,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:34,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:34,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:34,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:41,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:41,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:31:41,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:41,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:31:41,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:31:41,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:31:41,564 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 17:31:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:41,720 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 17:31:41,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:31:41,721 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 17:31:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:41,721 INFO L225 Difference]: With dead ends: 88 [2018-12-03 17:31:41,721 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:31:41,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 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 17:31:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:31:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 17:31:41,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:31:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 17:31:41,725 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 17:31:41,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:41,725 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 17:31:41,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:31:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 17:31:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:31:41,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:41,726 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 17:31:41,726 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:41,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-12-03 17:31:41,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:41,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:41,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:41,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:44,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:44,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:44,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:44,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:44,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:44,491 INFO 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 17:31:44,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:44,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:44,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:44,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:52,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:52,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:31:52,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:52,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:31:52,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:31:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:31:52,299 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 17:31:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:52,585 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 17:31:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:31:52,586 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 17:31:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:52,586 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:31:52,586 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:31:52,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 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 17:31:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:31:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 17:31:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:31:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 17:31:52,589 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 17:31:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:52,589 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 17:31:52,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:31:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 17:31:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:31:52,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:52,590 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 17:31:52,590 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:52,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-12-03 17:31:52,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:52,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:52,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:52,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:52,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:55,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:55,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:55,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:55,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:55,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:55,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:31:55,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:55,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:55,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 17:31:55,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:55,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:55,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:03,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:03,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:32:03,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:03,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:32:03,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:32:03,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:32:03,355 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 17:32:03,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:03,497 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 17:32:03,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:32:03,497 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 17:32:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:03,498 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:32:03,498 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 17:32:03,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:32:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 17:32:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 17:32:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:32:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 17:32:03,503 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 17:32:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:03,503 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 17:32:03,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:32:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 17:32:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:32:03,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:03,504 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 17:32:03,504 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:03,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-12-03 17:32:03,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:03,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:03,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:06,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:06,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:06,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:06,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:06,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:06,071 INFO 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 17:32:06,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:06,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:06,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:06,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:06,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:06,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:14,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:14,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:32:14,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:14,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:32:14,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:32:14,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:32:14,465 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 17:32:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:14,619 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 17:32:14,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:32:14,620 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 17:32:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:14,620 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:32:14,621 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:32:14,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:32:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:32:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 17:32:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:32:14,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 17:32:14,625 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 17:32:14,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:14,626 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 17:32:14,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:32:14,626 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 17:32:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:32:14,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:14,627 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 17:32:14,627 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:14,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:14,627 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-12-03 17:32:14,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:14,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:14,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:14,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:14,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:17,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:17,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:17,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:17,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:17,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:17,340 INFO 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 17:32:17,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:17,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:17,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:17,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:25,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:25,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:32:25,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:25,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:32:25,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:32:25,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:32:25,835 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 17:32:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:26,213 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 17:32:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:32:26,214 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 17:32:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:26,215 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:32:26,215 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:32:26,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:32:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:32:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:32:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:32:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 17:32:26,218 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 17:32:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:26,219 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 17:32:26,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:32:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 17:32:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:32:26,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:26,219 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 17:32:26,220 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:26,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-12-03 17:32:26,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:26,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:26,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:26,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:29,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:29,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:29,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:29,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:29,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:29,188 INFO 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 17:32:29,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:29,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:29,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 17:32:29,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:29,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:29,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:37,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:37,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:32:37,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:37,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:32:37,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:32:37,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:32:37,864 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 17:32:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:38,080 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 17:32:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:32:38,081 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 17:32:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:38,082 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:32:38,082 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:32:38,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:32:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:32:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:32:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:32:38,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 17:32:38,085 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 17:32:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:38,085 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 17:32:38,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:32:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 17:32:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:32:38,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:38,086 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 17:32:38,086 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:38,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:38,086 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-12-03 17:32:38,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:38,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:38,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:38,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:38,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:41,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:41,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:41,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:41,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:41,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:41,338 INFO 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 17:32:41,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:41,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:41,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:41,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:41,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:41,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:50,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:50,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:32:50,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:50,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:32:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:32:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:32:50,269 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 17:32:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:50,395 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 17:32:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:32:50,396 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 17:32:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:50,397 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:32:50,397 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:32:50,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:32:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:32:50,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:32:50,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:32:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 17:32:50,401 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 17:32:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:50,402 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 17:32:50,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:32:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 17:32:50,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:32:50,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:50,402 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 17:32:50,402 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:50,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:50,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-12-03 17:32:50,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:50,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:50,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:50,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:53,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:53,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:53,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:53,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:53,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:53,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:53,236 INFO 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 17:32:53,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:53,245 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:53,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:53,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:02,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:02,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:02,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:33:02,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:02,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:33:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:33:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:33:02,192 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 17:33:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:02,419 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 17:33:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:33:02,420 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 17:33:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:02,420 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:33:02,420 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:33:02,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:33:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:33:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:33:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:33:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 17:33:02,423 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 17:33:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:02,423 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 17:33:02,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:33:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 17:33:02,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:33:02,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:02,424 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 17:33:02,424 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:02,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-12-03 17:33:02,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:02,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:02,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:02,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:05,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:05,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:05,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:05,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:05,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:05,620 INFO 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 17:33:05,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:05,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:05,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 17:33:05,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:05,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:05,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:14,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:14,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:33:14,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:14,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:33:14,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:33:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:33:14,882 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 17:33:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:15,013 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 17:33:15,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:33:15,014 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 17:33:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:15,015 INFO L225 Difference]: With dead ends: 96 [2018-12-03 17:33:15,015 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:33:15,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 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 17:33:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:33:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 17:33:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:33:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 17:33:15,018 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 17:33:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:15,019 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 17:33:15,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:33:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 17:33:15,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:33:15,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:15,019 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 17:33:15,019 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:15,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-12-03 17:33:15,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:15,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:15,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:15,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:15,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:18,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:18,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:18,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:18,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:18,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:18,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:33:18,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:18,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:18,196 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:18,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:18,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:18,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:27,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:27,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:33:27,442 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:27,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:33:27,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:33:27,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:33:27,443 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 17:33:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:27,682 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 17:33:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:33:27,682 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 17:33:27,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:27,683 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:33:27,683 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:33:27,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:33:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:33:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:33:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:33:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 17:33:27,688 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 17:33:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:27,688 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 17:33:27,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:33:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 17:33:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:33:27,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:27,689 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 17:33:27,689 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:27,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:27,689 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-12-03 17:33:27,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:27,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:27,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:30,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:30,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:30,984 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:30,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:30,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:30,985 INFO 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 17:33:30,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:30,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:31,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:31,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:40,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:40,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:33:40,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:40,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:33:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:33:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:33:40,470 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 17:33:40,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:40,663 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 17:33:40,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:33:40,663 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 17:33:40,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:40,664 INFO L225 Difference]: With dead ends: 98 [2018-12-03 17:33:40,664 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 17:33:40,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:33:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 17:33:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 17:33:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:33:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 17:33:40,668 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 17:33:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:40,669 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 17:33:40,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:33:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 17:33:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:33:40,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:40,669 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 17:33:40,669 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:40,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-12-03 17:33:40,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:40,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:40,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:43,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:43,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:43,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:43,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:43,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:43,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:33:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:43,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:44,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 17:33:44,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:44,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:44,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:53,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:53,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:33:53,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:53,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:33:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:33:53,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:33:53,778 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 17:33:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:53,928 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 17:33:53,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:33:53,928 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 17:33:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:53,929 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:33:53,929 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:33:53,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:33:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:33:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 17:33:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:33:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 17:33:53,933 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 17:33:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:53,934 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 17:33:53,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:33:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 17:33:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:33:53,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:53,934 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 17:33:53,934 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:53,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:53,935 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-12-03 17:33:53,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:53,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:53,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:53,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:53,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:57,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:57,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:57,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:57,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:57,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:57,435 INFO 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 17:33:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:57,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:57,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:57,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:57,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:57,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:07,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:07,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:34:07,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:07,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:34:07,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:34:07,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:34:07,756 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 17:34:07,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:07,899 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 17:34:07,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:34:07,899 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 17:34:07,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:07,900 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:34:07,900 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:34:07,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:34:07,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:34:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:34:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:34:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 17:34:07,905 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 17:34:07,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:07,905 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 17:34:07,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:34:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 17:34:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:34:07,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:07,906 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 17:34:07,907 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:07,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:07,907 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-12-03 17:34:07,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:07,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:07,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:07,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:07,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:11,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:11,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:11,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:11,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:11,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:11,359 INFO 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 17:34:11,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:11,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:11,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:11,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:21,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:21,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:34:21,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:21,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:34:21,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:34:21,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:34:21,664 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 17:34:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:21,830 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 17:34:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:34:21,830 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 17:34:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:21,831 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:34:21,831 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:34:21,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:34:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:34:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:34:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:34:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 17:34:21,834 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 17:34:21,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:21,834 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 17:34:21,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:34:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 17:34:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:34:21,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:21,835 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 17:34:21,835 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:21,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:21,835 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-12-03 17:34:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:21,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:21,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:21,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:21,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:25,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:25,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:25,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:25,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:25,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:25,159 INFO 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 17:34:25,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:25,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:25,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 17:34:25,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:25,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:25,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:35,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:35,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:34:35,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:35,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:34:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:34:35,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:34:35,744 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 17:34:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:35,899 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 17:34:35,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:34:35,899 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 17:34:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:35,900 INFO L225 Difference]: With dead ends: 102 [2018-12-03 17:34:35,900 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:34:35,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:34:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:34:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:34:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:34:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 17:34:35,905 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 17:34:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:35,905 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 17:34:35,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:34:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 17:34:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:34:35,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:35,906 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 17:34:35,906 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:35,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:35,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-12-03 17:34:35,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:35,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:35,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:35,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:35,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:39,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:39,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:39,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:39,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:39,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:39,580 INFO 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 17:34:39,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:39,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:39,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:39,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:39,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:39,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:50,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:50,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:34:50,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:50,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:34:50,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:34:50,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:34:50,182 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 17:34:50,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:50,387 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 17:34:50,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:34:50,387 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 17:34:50,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:50,388 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:34:50,388 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:34:50,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:34:50,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:34:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:34:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:34:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 17:34:50,392 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 17:34:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:50,393 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 17:34:50,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:34:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 17:34:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:34:50,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:50,393 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 17:34:50,393 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:50,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:50,394 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-12-03 17:34:50,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:50,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:50,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:54,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:54,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:54,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:54,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:54,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:54,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:34:54,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:54,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:54,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:54,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:04,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:04,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:04,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:35:04,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:04,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:35:04,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:35:04,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:35:04,944 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 17:35:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:05,235 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 17:35:05,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:35:05,236 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 17:35:05,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:05,236 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:35:05,237 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 17:35:05,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:35:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 17:35:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 17:35:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:35:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 17:35:05,240 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 17:35:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:05,240 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 17:35:05,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:35:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 17:35:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:35:05,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:05,241 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 17:35:05,241 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:05,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-12-03 17:35:05,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:05,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:05,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:05,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:05,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:09,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:09,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:09,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:09,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:09,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:09,214 INFO 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 17:35:09,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:09,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:09,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 17:35:09,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:09,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:09,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:20,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:20,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:35:20,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:20,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:35:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:35:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:35:20,330 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 17:35:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:20,568 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 17:35:20,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:35:20,569 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 17:35:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:20,570 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:35:20,570 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:35:20,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:35:20,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:35:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 17:35:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 17:35:20,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 17:35:20,574 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 17:35:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:20,574 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 17:35:20,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:35:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 17:35:20,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:35:20,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:20,575 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 17:35:20,575 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:20,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-12-03 17:35:20,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:20,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:20,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:24,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:24,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:24,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:24,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:24,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:24,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:35:24,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:24,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:24,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:24,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:24,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:24,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:24,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:35,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:35,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:35:35,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:35,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:35:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:35:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:35:35,642 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 17:35:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:35,918 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 17:35:35,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:35:35,918 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 17:35:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:35,919 INFO L225 Difference]: With dead ends: 106 [2018-12-03 17:35:35,919 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:35:35,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:35:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:35:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 17:35:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:35:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 17:35:35,924 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 17:35:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:35,924 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 17:35:35,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:35:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 17:35:35,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:35:35,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:35,925 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 17:35:35,925 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:35,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-12-03 17:35:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:35,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:35,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:35,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:39,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:39,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:39,867 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:39,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:39,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:39,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:39,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:39,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:40,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:40,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:51,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:51,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:35:51,332 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:35:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:35:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:35:51,335 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 17:35:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:51,518 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 17:35:51,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:35:51,519 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 17:35:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:51,520 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:35:51,520 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:35:51,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:35:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:35:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 17:35:51,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:35:51,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 17:35:51,525 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 17:35:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:51,525 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 17:35:51,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:35:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 17:35:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:35:51,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:51,526 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 17:35:51,526 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:51,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:51,527 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-12-03 17:35:51,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:51,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:51,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:55,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:55,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:55,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:55,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:55,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:55,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:55,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:55,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:55,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 17:35:55,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:55,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:55,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:07,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:07,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 17:36:07,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:07,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 17:36:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 17:36:07,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:36:07,343 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 17:36:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:07,677 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 17:36:07,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 17:36:07,677 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 17:36:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:07,678 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:36:07,678 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:36:07,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:36:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:36:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:36:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:36:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 17:36:07,682 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 17:36:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:07,683 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 17:36:07,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 17:36:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 17:36:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:36:07,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:07,684 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 17:36:07,684 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:07,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:07,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-12-03 17:36:07,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:07,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:07,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:11,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:11,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:11,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:11,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 17:36:11,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:11,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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:11,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:11,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:11,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:11,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:11,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:11,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:11,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:23,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:23,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 17:36:23,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:23,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:36:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:36:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:36:23,712 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 17:36:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:24,042 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 17:36:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:36:24,043 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 17:36:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:24,044 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:36:24,044 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:36:24,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:36:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:36:24,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:36:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:36:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 17:36:24,048 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 17:36:24,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:24,048 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 17:36:24,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:36:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 17:36:24,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:36:24,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:24,049 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 17:36:24,049 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:24,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:24,050 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-12-03 17:36:24,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:24,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:24,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:24,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:24,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:28,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:28,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:28,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:28,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:28,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:28,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:28,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:28,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:28,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:28,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:40,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:40,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 17:36:40,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:40,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 17:36:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 17:36:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:36:40,429 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 17:36:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:40,660 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 17:36:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:36:40,661 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 17:36:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:40,661 INFO L225 Difference]: With dead ends: 110 [2018-12-03 17:36:40,662 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:36:40,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:36:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:36:40,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:36:40,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:36:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 17:36:40,666 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 17:36:40,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:40,667 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 17:36:40,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 17:36:40,667 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 17:36:40,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:36:40,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:40,667 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 17:36:40,667 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:40,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-12-03 17:36:40,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:40,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:40,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:40,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:44,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:44,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:44,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:44,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:44,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:44,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:44,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:44,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:45,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 17:36:45,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:45,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:45,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:57,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:57,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 17:36:57,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:57,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:36:57,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:36:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:36:57,352 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 17:36:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:57,592 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 17:36:57,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:36:57,593 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 17:36:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:57,594 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:36:57,594 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:36:57,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:36:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:36:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:36:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:36:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 17:36:57,599 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 17:36:57,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:57,599 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 17:36:57,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:36:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 17:36:57,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:36:57,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:57,600 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 17:36:57,600 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:57,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:57,600 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-12-03 17:36:57,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:57,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:57,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:57,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:57,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:01,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:01,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:01,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:01,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:01,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:01,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:01,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:02,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:02,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:02,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:02,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:14,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:14,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 17:37:14,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:14,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:37:14,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:37:14,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:37:14,735 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 17:37:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:15,028 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 17:37:15,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 17:37:15,028 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 17:37:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:15,028 INFO L225 Difference]: With dead ends: 112 [2018-12-03 17:37:15,028 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:37:15,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:37:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:37:15,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 17:37:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:37:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 17:37:15,031 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 17:37:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:15,032 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 17:37:15,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:37:15,032 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 17:37:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:37:15,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:15,032 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 17:37:15,033 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:15,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-12-03 17:37:15,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:15,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:15,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:15,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:15,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:19,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:19,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:19,243 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:19,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:19,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:19,243 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:19,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:19,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:19,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:19,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:32,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:32,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 17:37:32,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:32,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:37:32,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:37:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:37:32,505 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 17:37:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:32,774 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 17:37:32,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:37:32,774 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 17:37:32,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:32,775 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:37:32,775 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:37:32,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:37:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:37:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 17:37:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 17:37:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 17:37:32,780 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 17:37:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:32,780 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 17:37:32,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:37:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 17:37:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:37:32,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:32,781 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 17:37:32,781 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:32,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:32,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-12-03 17:37:32,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:32,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:32,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:32,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:37,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:37,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:37,384 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:37,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:37,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:37,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:37,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:37:37,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:37:37,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 17:37:37,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:37,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:37,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:50,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:50,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 17:37:50,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:50,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:37:50,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:37:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:37:50,553 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 17:37:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:50,882 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 17:37:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:37:50,883 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 17:37:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:50,883 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:37:50,883 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:37:50,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:37:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:37:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:37:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:37:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 17:37:50,887 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 17:37:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:50,887 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 17:37:50,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:37:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 17:37:50,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:37:50,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:50,888 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 17:37:50,888 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:50,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-12-03 17:37:50,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:50,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:50,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:50,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:55,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:55,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:55,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:55,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:55,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:55,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:55,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:55,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:55,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:55,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:55,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:55,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 17:38:08,918 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:08,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:38:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:38:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:38:08,920 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 17:38:09,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:09,193 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 17:38:09,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:38:09,193 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 17:38:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:09,194 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:38:09,194 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:38:09,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:38:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:38:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 17:38:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:38:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 17:38:09,198 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 17:38:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:09,198 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 17:38:09,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:38:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 17:38:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:38:09,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:09,199 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 17:38:09,199 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:09,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:09,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-12-03 17:38:09,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:09,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:09,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:09,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:09,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:13,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:13,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:13,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:13,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 17:38:13,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:13,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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:13,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:13,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:38:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:13,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:13,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:27,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:27,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 17:38:27,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:27,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:38:27,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:38:27,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:38:27,614 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 17:38:27,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:27,832 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 17:38:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 17:38:27,833 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 17:38:27,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:27,833 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:38:27,834 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:38:27,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:38:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:38:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:38:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:38:27,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 17:38:27,838 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 17:38:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:27,839 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 17:38:27,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:38:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 17:38:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:38:27,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:27,840 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 17:38:27,840 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:27,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:27,840 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-12-03 17:38:27,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:27,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:27,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:27,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:27,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:32,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:32,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:32,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:32,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:32,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:32,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:32,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:32,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:32,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 17:38:32,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:32,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:32,782 INFO L316 TraceCheckSpWp]: Computing backward predicates...