java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:47:46,267 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:47:46,272 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:47:46,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:47:46,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:47:46,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:47:46,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:47:46,288 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:47:46,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:47:46,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:47:46,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:47:46,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:47:46,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:47:46,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:47:46,295 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:47:46,296 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:47:46,297 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:47:46,299 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:47:46,301 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:47:46,302 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:47:46,303 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:47:46,305 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:47:46,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:47:46,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:47:46,308 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:47:46,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:47:46,309 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:47:46,310 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:47:46,311 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:47:46,315 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:47:46,316 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:47:46,316 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:47:46,317 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:47:46,317 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:47:46,318 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:47:46,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:47:46,319 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:47:46,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:47:46,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:47:46,342 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:47:46,342 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:47:46,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:47:46,342 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:47:46,342 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:47:46,344 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:47:46,344 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:47:46,344 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:47:46,344 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:47:46,344 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:47:46,344 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:47:46,345 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:47:46,345 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:47:46,347 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:47:46,348 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:47:46,348 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:47:46,348 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:47:46,348 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:47:46,348 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:47:46,350 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:47:46,350 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:47:46,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:47:46,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:47:46,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:47:46,351 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:47:46,351 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:47:46,351 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:47:46,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:47:46,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:47:46,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:47:46,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:47:46,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:47:46,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:47:46,354 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:47:46,354 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:47:46,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:47:46,355 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:47:46,355 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:47:46,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:47:46,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:47:46,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:47:46,424 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:47:46,425 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:47:46,425 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 18:47:46,426 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-12-03 18:47:46,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:47:46,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:47:46,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:47:46,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:47:46,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:47:46,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:47:46,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:47:46,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:47:46,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:47:46,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/1) ... [2018-12-03 18:47:46,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:47:46,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:47:46,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:47:46,540 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:47:46,546 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (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 18:47:46,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 18:47:46,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:47:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:47:46,860 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:47:46,861 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:47:46,861 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:47:46 BoogieIcfgContainer [2018-12-03 18:47:46,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:47:46,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:47:46,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:47:46,866 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:47:46,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:47:46" (1/2) ... [2018-12-03 18:47:46,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c541a81 and model type gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:47:46, skipping insertion in model container [2018-12-03 18:47:46,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:47:46" (2/2) ... [2018-12-03 18:47:46,869 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-12-03 18:47:46,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:47:46,887 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:47:46,906 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:47:46,941 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:47:46,942 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:47:46,942 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:47:46,942 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:47:46,942 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:47:46,943 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:47:46,943 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:47:46,943 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:47:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-03 18:47:46,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:47:46,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:46,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:47:46,974 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:46,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:46,992 INFO L82 PathProgramCache]: Analyzing trace with hash 30023, now seen corresponding path program 1 times [2018-12-03 18:47:46,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:47,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:47,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:47,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:47,158 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 18:47:47,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:47:47,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:47:47,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:47,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:47:47,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:47:47,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:47:47,185 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-03 18:47:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:47,309 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2018-12-03 18:47:47,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:47:47,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:47:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:47,326 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:47:47,326 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:47:47,331 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 18:47:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:47:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:47:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:47:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 18:47:47,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2018-12-03 18:47:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:47,393 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 18:47:47,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:47:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 18:47:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:47:47,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:47,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 18:47:47,395 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:47,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:47,395 INFO L82 PathProgramCache]: Analyzing trace with hash 28788909, now seen corresponding path program 1 times [2018-12-03 18:47:47,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:47,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:47,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:47,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:47,512 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 18:47:47,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:47,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:47,514 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 18:47:47,517 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [11], [15] [2018-12-03 18:47:47,591 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:47,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:47,772 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 18:47:47,774 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 16 times. Widened at 2 different actions 8 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:47:47,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:47,819 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 18:47:47,862 INFO L219 lantSequenceWeakener]: Could never weaken! [2018-12-03 18:47:47,863 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 18:47:47,898 INFO L418 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-03 18:47:47,898 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 18:47:47,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 18:47:47,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2018-12-03 18:47:47,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:47:47,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:47:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:47:47,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:47:47,902 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 3 states. [2018-12-03 18:47:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:48,011 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 18:47:48,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:47:48,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 18:47:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:48,012 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:47:48,012 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:47:48,013 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 4 GetRequests, 3 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 18:47:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:47:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:47:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:47:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-03 18:47:48,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 5 [2018-12-03 18:47:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:48,019 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-03 18:47:48,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:47:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-03 18:47:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:47:48,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:48,020 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 18:47:48,021 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:48,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:48,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1896276501, now seen corresponding path program 1 times [2018-12-03 18:47:48,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:48,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:48,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:48,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:48,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:48,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:48,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:48,075 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 18:47:48,075 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [11], [13], [15] [2018-12-03 18:47:48,077 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:47:48,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:47:48,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:47:48,175 INFO L272 AbstractInterpreter]: Visited 6 different actions 46 times. Merged at 3 different actions 20 times. Widened at 3 different actions 12 times. Found 4 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:47:48,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:48,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:47:48,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:48,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:47:48,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:48,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:48,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:48,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:48,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:48,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:47:48,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:47:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:47:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:47:48,397 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-12-03 18:47:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:48,469 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-12-03 18:47:48,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:47:48,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 18:47:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:48,470 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:47:48,470 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:47:48,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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 18:47:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:47:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:47:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:47:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 18:47:48,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 7 [2018-12-03 18:47:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:48,479 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 18:47:48,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:47:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 18:47:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:47:48,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:48,481 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 18:47:48,481 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:48,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:48,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1253675643, now seen corresponding path program 2 times [2018-12-03 18:47:48,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:48,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:48,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:48,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:48,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:48,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:48,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:48,547 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:48,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:48,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:48,548 INFO 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 18:47:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:48,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:48,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:47:48,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:48,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:48,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:47:49,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:49,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 18:47:49,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:49,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:47:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:47:49,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:47:49,014 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 8 states. [2018-12-03 18:47:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:49,145 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2018-12-03 18:47:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:47:49,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 18:47:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:49,148 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:47:49,148 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:47:49,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:47:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:47:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-03 18:47:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:47:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-12-03 18:47:49,157 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2018-12-03 18:47:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:49,157 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-12-03 18:47:49,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:47:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2018-12-03 18:47:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:47:49,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:49,159 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 18:47:49,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:49,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash -74661839, now seen corresponding path program 3 times [2018-12-03 18:47:49,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:49,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:49,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:47:49,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:49,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:49,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:49,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:49,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:49,331 INFO 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 18:47:49,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:49,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:49,359 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:49,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:49,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:47:49,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:49,486 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:47:49,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:49,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 18:47:49,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:49,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:47:49,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:47:49,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:47:49,508 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2018-12-03 18:47:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:49,558 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-12-03 18:47:49,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:47:49,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 18:47:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:49,559 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:47:49,559 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:47:49,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:47:49,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:47:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:47:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:47:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 18:47:49,566 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2018-12-03 18:47:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:49,567 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 18:47:49,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:47:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 18:47:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:47:49,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:49,568 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 18:47:49,568 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:49,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:49,569 INFO L82 PathProgramCache]: Analyzing trace with hash 584297111, now seen corresponding path program 4 times [2018-12-03 18:47:49,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:49,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:49,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:49,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:47:49,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:49,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:49,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:49,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:49,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:49,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:47:49,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:49,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:49,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:47:49,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:47:50,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:50,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 18:47:50,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:50,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:47:50,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:47:50,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:47:50,129 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 7 states. [2018-12-03 18:47:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:50,226 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-12-03 18:47:50,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:47:50,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 18:47:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:50,229 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:47:50,229 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:47:50,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:47:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:47:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:47:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:47:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 18:47:50,237 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2018-12-03 18:47:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:50,237 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 18:47:50,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:47:50,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 18:47:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:47:50,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:50,238 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 18:47:50,239 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:50,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:50,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1811311747, now seen corresponding path program 5 times [2018-12-03 18:47:50,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:50,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:50,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:50,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:50,241 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 18:47:50,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:50,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:50,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:50,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:50,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:50,334 INFO 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 18:47:50,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:50,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:50,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:47:50,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:50,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 18:47:50,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 18:47:50,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:50,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 18:47:50,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:50,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:47:50,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:47:50,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:47:50,554 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 12 states. [2018-12-03 18:47:50,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:50,749 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2018-12-03 18:47:50,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:47:50,750 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 18:47:50,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:50,751 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:47:50,751 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:47:50,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:47:50,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:47:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 18:47:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:47:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-12-03 18:47:50,760 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 19 [2018-12-03 18:47:50,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:50,761 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-03 18:47:50,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:47:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-03 18:47:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:47:50,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:50,761 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 18:47:50,764 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:50,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1486667467, now seen corresponding path program 6 times [2018-12-03 18:47:50,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:50,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:50,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:50,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:50,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:50,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:50,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:50,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:50,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:50,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:50,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 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 18:47:50,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:50,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:50,934 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:50,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:50,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:50,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:51,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:51,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 18:47:51,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:51,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:47:51,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:47:51,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:47:51,271 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 9 states. [2018-12-03 18:47:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:51,397 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-12-03 18:47:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:47:51,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 18:47:51,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:51,398 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:47:51,399 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:47:51,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 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 18:47:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:47:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:47:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:47:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 18:47:51,407 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2018-12-03 18:47:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:51,407 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 18:47:51,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:47:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 18:47:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:47:51,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:51,408 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 18:47:51,409 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:51,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2057167665, now seen corresponding path program 7 times [2018-12-03 18:47:51,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:51,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:51,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:51,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:51,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:51,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:51,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:51,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:51,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:51,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:51,585 INFO 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 18:47:51,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:51,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:51,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:51,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:51,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:51,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 18:47:51,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:51,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:47:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:47:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:47:51,823 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 10 states. [2018-12-03 18:47:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:51,958 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-12-03 18:47:51,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:47:51,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 18:47:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:51,959 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:47:51,959 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:47:51,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 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 18:47:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:47:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:47:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:47:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 18:47:51,967 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 25 [2018-12-03 18:47:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:51,967 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 18:47:51,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:47:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 18:47:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:47:51,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:51,968 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 18:47:51,969 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:51,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:51,969 INFO L82 PathProgramCache]: Analyzing trace with hash 552044055, now seen corresponding path program 8 times [2018-12-03 18:47:51,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:51,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:51,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:51,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 18:47:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:52,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:52,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:52,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:52,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:52,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:47:52,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:52,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:52,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:47:52,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:52,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:52,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 18:47:52,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 18:47:52,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:52,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 18:47:52,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:52,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:47:52,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:47:52,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:47:52,354 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 16 states. [2018-12-03 18:47:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:52,756 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-12-03 18:47:52,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:47:52,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 18:47:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:52,760 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:47:52,760 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:47:52,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 18:47:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:47:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 18:47:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:47:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-03 18:47:52,769 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 27 [2018-12-03 18:47:52,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:52,769 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-03 18:47:52,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:47:52,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-03 18:47:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:47:52,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:52,770 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 18:47:52,770 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:52,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash -697357083, now seen corresponding path program 9 times [2018-12-03 18:47:52,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:52,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:52,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:52,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:52,923 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:47:52,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:52,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:52,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:52,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:52,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:52,925 INFO 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 18:47:52,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:52,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:52,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:52,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:52,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:47:52,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:47:53,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:53,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:47:53,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:53,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:47:53,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:47:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:47:53,197 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 12 states. [2018-12-03 18:47:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:53,275 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2018-12-03 18:47:53,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:47:53,276 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 18:47:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:53,277 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:47:53,277 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:47:53,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 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 18:47:53,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:47:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:47:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:47:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 18:47:53,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2018-12-03 18:47:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:53,288 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 18:47:53,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:47:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 18:47:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:47:53,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:53,289 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 18:47:53,289 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:53,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:53,290 INFO L82 PathProgramCache]: Analyzing trace with hash 441486155, now seen corresponding path program 10 times [2018-12-03 18:47:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:53,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:53,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:53,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:53,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:47:53,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:53,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:53,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:53,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:53,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:53,503 INFO 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 18:47:53,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:53,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:53,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:47:53,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:47:54,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:54,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 18:47:54,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:54,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:47:54,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:47:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:47:54,092 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 13 states. [2018-12-03 18:47:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:54,146 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-03 18:47:54,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:47:54,146 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 18:47:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:54,147 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:47:54,147 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:47:54,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 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 18:47:54,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:47:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:47:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:47:54,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 18:47:54,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 33 [2018-12-03 18:47:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:54,157 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 18:47:54,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:47:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 18:47:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:47:54,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:54,158 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 18:47:54,159 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:54,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:54,159 INFO L82 PathProgramCache]: Analyzing trace with hash -346822607, now seen corresponding path program 11 times [2018-12-03 18:47:54,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:54,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:54,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:54,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:54,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 18:47:54,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:54,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:54,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:54,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:54,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:54,404 INFO 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 18:47:54,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:54,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:54,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 18:47:54,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:54,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 18:47:54,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 18:47:54,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:54,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 18:47:54,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:54,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:47:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:47:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:47:54,872 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 20 states. [2018-12-03 18:47:55,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:55,170 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2018-12-03 18:47:55,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:47:55,171 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 18:47:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:55,172 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:47:55,173 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:47:55,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:47:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:47:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 18:47:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:47:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-03 18:47:55,183 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 35 [2018-12-03 18:47:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:55,184 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-03 18:47:55,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:47:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-03 18:47:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:47:55,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:55,185 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 18:47:55,185 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:55,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:55,186 INFO L82 PathProgramCache]: Analyzing trace with hash 446179967, now seen corresponding path program 12 times [2018-12-03 18:47:55,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:55,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:55,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:55,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:47:55,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:55,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:55,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:55,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:55,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:55,543 INFO 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 18:47:55,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:55,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:55,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:55,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:55,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:47:55,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:47:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 18:47:56,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:56,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:47:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:47:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:47:56,155 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 15 states. [2018-12-03 18:47:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:56,253 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2018-12-03 18:47:56,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:47:56,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 18:47:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:56,255 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:47:56,255 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:47:56,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:47:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:47:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:47:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:47:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 18:47:56,266 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 39 [2018-12-03 18:47:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:56,266 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 18:47:56,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:47:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 18:47:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:47:56,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:56,267 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 18:47:56,268 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:56,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:56,268 INFO L82 PathProgramCache]: Analyzing trace with hash 562021093, now seen corresponding path program 13 times [2018-12-03 18:47:56,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:56,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:56,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:56,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:56,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:47:56,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:56,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:56,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:56,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:56,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:56,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:47:56,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:56,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:47:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:56,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:47:56,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:47:56,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:56,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 18:47:56,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:56,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:47:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:47:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:47:56,906 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 16 states. [2018-12-03 18:47:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:57,105 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2018-12-03 18:47:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:47:57,106 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 18:47:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:57,107 INFO L225 Difference]: With dead ends: 59 [2018-12-03 18:47:57,107 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:47:57,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:47:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:47:57,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:47:57,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:47:57,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 18:47:57,121 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 41 [2018-12-03 18:47:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:57,121 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 18:47:57,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:47:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 18:47:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:47:57,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:57,122 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 18:47:57,123 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:57,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash 216193483, now seen corresponding path program 14 times [2018-12-03 18:47:57,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:57,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:57,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:47:57,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:57,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:57,320 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 18:47:57,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:57,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:57,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:57,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 18:47:57,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:57,321 INFO 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 18:47:57,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:47:57,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:47:57,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:47:57,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:57,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 18:47:58,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 18:47:58,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:58,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 18:47:58,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:58,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:47:58,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:47:58,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:47:58,173 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 24 states. [2018-12-03 18:47:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:58,290 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2018-12-03 18:47:58,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:47:58,290 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 18:47:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:58,291 INFO L225 Difference]: With dead ends: 64 [2018-12-03 18:47:58,291 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:47:58,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:47:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:47:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 18:47:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:47:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-03 18:47:58,300 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 43 [2018-12-03 18:47:58,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:58,300 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-03 18:47:58,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:47:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-03 18:47:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:47:58,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:58,301 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 18:47:58,302 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:58,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 606328729, now seen corresponding path program 15 times [2018-12-03 18:47:58,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:58,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:58,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:47:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:47:58,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:58,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:47:58,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:47:58,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:47:58,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:47:58,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:47:58,548 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:47:58,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:47:58,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:47:58,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:47:58,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:47:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:47:58,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:47:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:47:59,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:47:59,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 18:47:59,632 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:47:59,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:47:59,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:47:59,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:47:59,633 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 18 states. [2018-12-03 18:47:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:47:59,747 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-12-03 18:47:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:47:59,747 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 18:47:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:47:59,748 INFO L225 Difference]: With dead ends: 67 [2018-12-03 18:47:59,748 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:47:59,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 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 18:47:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:47:59,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 18:47:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:47:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 18:47:59,756 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 47 [2018-12-03 18:47:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:47:59,756 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 18:47:59,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:47:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 18:47:59,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:47:59,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:47:59,758 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 18:47:59,758 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:47:59,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:47:59,758 INFO L82 PathProgramCache]: Analyzing trace with hash 154642943, now seen corresponding path program 16 times [2018-12-03 18:47:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:47:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:59,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:47:59,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:47:59,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:47:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:48:00,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:00,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:00,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:00,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 18:48:00,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:00,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 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 18:48:00,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:00,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:00,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:48:00,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:48:01,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:01,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 18:48:01,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:01,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:48:01,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:48:01,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:48:01,054 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 19 states. [2018-12-03 18:48:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:01,129 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-12-03 18:48:01,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:48:01,129 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 18:48:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:01,130 INFO L225 Difference]: With dead ends: 69 [2018-12-03 18:48:01,130 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:48:01,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:48:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:48:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:48:01,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:48:01,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 18:48:01,141 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 49 [2018-12-03 18:48:01,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:01,141 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 18:48:01,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:48:01,141 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 18:48:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:48:01,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:01,142 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 18:48:01,142 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:01,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:01,143 INFO L82 PathProgramCache]: Analyzing trace with hash -123700507, now seen corresponding path program 17 times [2018-12-03 18:48:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:01,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:01,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 18:48:01,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:01,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:01,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:01,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:01,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:01,479 INFO 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 18:48:01,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:01,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:01,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:48:01,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:01,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 18:48:02,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 18:48:02,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:02,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 18:48:02,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:02,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:48:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:48:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:48:02,489 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2018-12-03 18:48:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:02,873 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-12-03 18:48:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:48:02,874 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 18:48:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:02,875 INFO L225 Difference]: With dead ends: 74 [2018-12-03 18:48:02,875 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:48:02,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:48:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:48:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 18:48:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 18:48:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-12-03 18:48:02,885 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 51 [2018-12-03 18:48:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:02,885 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-12-03 18:48:02,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:48:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-12-03 18:48:02,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:48:02,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:02,886 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 18:48:02,886 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:02,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:02,886 INFO L82 PathProgramCache]: Analyzing trace with hash -845786061, now seen corresponding path program 18 times [2018-12-03 18:48:02,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:02,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:02,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:02,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:02,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:48:03,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:03,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:03,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:03,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:03,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:03,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:03,143 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:03,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:03,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:03,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:48:03,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:48:03,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:03,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 18:48:03,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:03,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:48:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:48:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:48:03,899 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 21 states. [2018-12-03 18:48:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:04,014 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2018-12-03 18:48:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:48:04,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 18:48:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:04,015 INFO L225 Difference]: With dead ends: 77 [2018-12-03 18:48:04,016 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 18:48:04,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:48:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 18:48:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 18:48:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:48:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 18:48:04,025 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 55 [2018-12-03 18:48:04,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:04,025 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 18:48:04,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:48:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 18:48:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:48:04,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:04,026 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 18:48:04,026 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:04,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:04,027 INFO L82 PathProgramCache]: Analyzing trace with hash 637296793, now seen corresponding path program 19 times [2018-12-03 18:48:04,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:04,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:04,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:04,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:04,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:48:04,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:04,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:04,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:04,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 18:48:04,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:04,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 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 18:48:04,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:04,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:04,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:48:04,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:48:05,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:05,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 18:48:05,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:05,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:48:05,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:48:05,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:48:05,230 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 22 states. [2018-12-03 18:48:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:05,304 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2018-12-03 18:48:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:48:05,306 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 18:48:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:05,307 INFO L225 Difference]: With dead ends: 79 [2018-12-03 18:48:05,307 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 18:48:05,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:48:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 18:48:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 18:48:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 18:48:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 18:48:05,315 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 57 [2018-12-03 18:48:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:05,316 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 18:48:05,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:48:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 18:48:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:48:05,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:05,317 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 18:48:05,317 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:05,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash -49222785, now seen corresponding path program 20 times [2018-12-03 18:48:05,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:05,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:05,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:05,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:05,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 18:48:05,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:05,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:05,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:05,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 18:48:05,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:05,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:05,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:05,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:05,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 18:48:05,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:05,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 18:48:05,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 18:48:05,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:05,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 18:48:05,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:05,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:48:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:48:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:48:05,996 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 32 states. [2018-12-03 18:48:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:06,155 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-03 18:48:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:48:06,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 18:48:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:06,160 INFO L225 Difference]: With dead ends: 84 [2018-12-03 18:48:06,160 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 18:48:06,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 18:48:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 18:48:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 18:48:06,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:48:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-12-03 18:48:06,169 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 59 [2018-12-03 18:48:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:06,169 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-12-03 18:48:06,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:48:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-12-03 18:48:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:48:06,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:06,170 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 18:48:06,171 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:06,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash -823410611, now seen corresponding path program 21 times [2018-12-03 18:48:06,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:06,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:06,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:06,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:06,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:48:06,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:06,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:06,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:06,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 18:48:06,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:06,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 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 18:48:06,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:06,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:06,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:06,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:06,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:48:06,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:48:07,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:07,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 18:48:07,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:07,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:48:07,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:48:07,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:48:07,101 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 24 states. [2018-12-03 18:48:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:07,176 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2018-12-03 18:48:07,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:48:07,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 18:48:07,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:07,177 INFO L225 Difference]: With dead ends: 87 [2018-12-03 18:48:07,177 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 18:48:07,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:48:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 18:48:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 18:48:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 18:48:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 18:48:07,186 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 63 [2018-12-03 18:48:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:07,186 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 18:48:07,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:48:07,186 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 18:48:07,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:48:07,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:07,187 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 18:48:07,187 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:07,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1446377805, now seen corresponding path program 22 times [2018-12-03 18:48:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:07,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:48:08,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:08,237 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:08,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:08,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:08,238 INFO 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 18:48:08,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:08,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:08,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:48:08,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:48:09,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 18:48:09,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:09,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:48:09,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:48:09,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:48:09,200 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 25 states. [2018-12-03 18:48:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:09,289 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2018-12-03 18:48:09,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:48:09,290 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 18:48:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:09,291 INFO L225 Difference]: With dead ends: 89 [2018-12-03 18:48:09,291 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 18:48:09,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:48:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 18:48:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 18:48:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:48:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 18:48:09,298 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 65 [2018-12-03 18:48:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:09,298 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 18:48:09,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:48:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 18:48:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 18:48:09,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:09,299 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 18:48:09,299 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:09,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1177570201, now seen corresponding path program 23 times [2018-12-03 18:48:09,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:09,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:09,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:09,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 18:48:09,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:09,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:09,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:09,800 INFO 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 18:48:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:09,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:09,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:48:09,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:09,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:10,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 18:48:10,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 18:48:10,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:10,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 18:48:10,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:10,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:48:10,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:48:10,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:48:10,535 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 36 states. [2018-12-03 18:48:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:10,681 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2018-12-03 18:48:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:48:10,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 18:48:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:10,682 INFO L225 Difference]: With dead ends: 94 [2018-12-03 18:48:10,682 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 18:48:10,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:48:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 18:48:10,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 18:48:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 18:48:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-12-03 18:48:10,692 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 67 [2018-12-03 18:48:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:10,692 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-12-03 18:48:10,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:48:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-12-03 18:48:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 18:48:10,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:10,693 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 18:48:10,693 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:10,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1066941415, now seen corresponding path program 24 times [2018-12-03 18:48:10,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:10,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:10,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:48:11,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:11,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:11,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:11,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:11,274 INFO 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 18:48:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:11,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:11,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:11,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:11,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:48:11,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:48:12,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:12,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 18:48:12,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:12,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:48:12,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:48:12,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:12,033 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 27 states. [2018-12-03 18:48:12,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:12,160 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2018-12-03 18:48:12,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:48:12,161 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 18:48:12,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:12,162 INFO L225 Difference]: With dead ends: 97 [2018-12-03 18:48:12,162 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 18:48:12,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 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 18:48:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 18:48:12,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 18:48:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 18:48:12,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 18:48:12,172 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 71 [2018-12-03 18:48:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:12,172 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 18:48:12,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:48:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 18:48:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 18:48:12,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:12,173 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 18:48:12,173 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:12,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash 638893133, now seen corresponding path program 25 times [2018-12-03 18:48:12,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:12,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:12,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:12,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:48:12,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:12,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:12,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:12,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:12,608 INFO 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 18:48:12,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:12,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:12,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:48:12,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:48:13,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:13,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 18:48:13,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:13,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:48:13,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:48:13,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:13,788 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 28 states. [2018-12-03 18:48:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:14,109 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2018-12-03 18:48:14,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:48:14,110 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 18:48:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:14,111 INFO L225 Difference]: With dead ends: 99 [2018-12-03 18:48:14,111 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 18:48:14,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 18:48:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 18:48:14,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 18:48:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 18:48:14,121 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 73 [2018-12-03 18:48:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:14,121 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 18:48:14,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:48:14,121 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 18:48:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:48:14,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:14,122 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 18:48:14,122 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:14,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1601354547, now seen corresponding path program 26 times [2018-12-03 18:48:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:14,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:14,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 18:48:15,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:15,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:15,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:15,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:15,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:15,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:15,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:15,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:15,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 18:48:15,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:15,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 18:48:15,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 18:48:15,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:15,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 18:48:15,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:15,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:48:15,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:48:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:48:15,784 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 40 states. [2018-12-03 18:48:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:15,985 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-12-03 18:48:15,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:48:15,986 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 18:48:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:15,987 INFO L225 Difference]: With dead ends: 104 [2018-12-03 18:48:15,987 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 18:48:15,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 18:48:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 18:48:15,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 18:48:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 18:48:15,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-12-03 18:48:15,996 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 75 [2018-12-03 18:48:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:15,996 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-12-03 18:48:15,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:48:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-12-03 18:48:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 18:48:15,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:15,997 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 18:48:15,997 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:15,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:15,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1735923967, now seen corresponding path program 27 times [2018-12-03 18:48:15,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:15,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:15,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:15,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:48:17,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:17,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:17,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:17,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:17,116 INFO 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 18:48:17,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:17,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:17,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:17,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:17,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:48:17,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:48:17,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:17,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 18:48:17,918 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:17,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:48:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:48:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:17,919 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 30 states. [2018-12-03 18:48:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:18,033 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2018-12-03 18:48:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:48:18,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 18:48:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:18,035 INFO L225 Difference]: With dead ends: 107 [2018-12-03 18:48:18,035 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 18:48:18,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 18:48:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 18:48:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 18:48:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 18:48:18,045 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 79 [2018-12-03 18:48:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:18,045 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 18:48:18,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:48:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 18:48:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 18:48:18,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:18,046 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 18:48:18,046 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:18,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1916231321, now seen corresponding path program 28 times [2018-12-03 18:48:18,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:18,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:18,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:18,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:48:18,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:18,434 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:18,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:18,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 18:48:18,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:18,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 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 18:48:18,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:18,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:18,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:48:18,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:20,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:48:20,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:20,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 18:48:20,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:20,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:48:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:48:20,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:20,283 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 31 states. [2018-12-03 18:48:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:20,438 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2018-12-03 18:48:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:48:20,439 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 18:48:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:20,440 INFO L225 Difference]: With dead ends: 109 [2018-12-03 18:48:20,440 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 18:48:20,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 18:48:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 18:48:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 18:48:20,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 18:48:20,454 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 81 [2018-12-03 18:48:20,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:20,455 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 18:48:20,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:48:20,455 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 18:48:20,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 18:48:20,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:20,456 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 18:48:20,456 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:20,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash 902060621, now seen corresponding path program 29 times [2018-12-03 18:48:20,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:20,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:20,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:20,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:20,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 18:48:20,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:20,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:20,920 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:20,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:20,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:20,920 INFO 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 18:48:20,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:20,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:20,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 18:48:20,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:20,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:21,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 18:48:21,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 18:48:21,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:21,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 18:48:21,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:21,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:48:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:48:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:48:21,782 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 44 states. [2018-12-03 18:48:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:21,980 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2018-12-03 18:48:21,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:48:21,981 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 18:48:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:21,982 INFO L225 Difference]: With dead ends: 114 [2018-12-03 18:48:21,982 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 18:48:21,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:48:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 18:48:21,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 18:48:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:48:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2018-12-03 18:48:21,992 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 83 [2018-12-03 18:48:21,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:21,992 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2018-12-03 18:48:21,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:48:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2018-12-03 18:48:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:48:21,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:21,993 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 18:48:21,994 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:21,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:21,994 INFO L82 PathProgramCache]: Analyzing trace with hash 907993499, now seen corresponding path program 30 times [2018-12-03 18:48:21,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:21,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:21,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:48:22,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:22,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:22,470 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:22,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:22,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:22,471 INFO 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 18:48:22,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:22,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:22,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:22,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:22,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:48:22,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:48:23,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:23,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 18:48:23,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:23,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:48:23,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:48:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:23,338 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand 33 states. [2018-12-03 18:48:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:23,529 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2018-12-03 18:48:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:48:23,530 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 18:48:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:23,530 INFO L225 Difference]: With dead ends: 117 [2018-12-03 18:48:23,531 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 18:48:23,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:23,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 18:48:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 18:48:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 18:48:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 18:48:23,542 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 87 [2018-12-03 18:48:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:23,543 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 18:48:23,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:48:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 18:48:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 18:48:23,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:23,544 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 18:48:23,544 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:23,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1219897855, now seen corresponding path program 31 times [2018-12-03 18:48:23,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:23,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:23,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:48:24,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:24,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:24,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:24,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:24,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:24,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:24,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:24,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:24,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:24,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:48:24,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:48:24,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:24,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 18:48:24,917 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:24,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:48:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:48:24,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:24,918 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 34 states. [2018-12-03 18:48:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:25,137 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2018-12-03 18:48:25,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:48:25,138 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 18:48:25,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:25,138 INFO L225 Difference]: With dead ends: 119 [2018-12-03 18:48:25,138 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 18:48:25,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 18:48:25,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 18:48:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 18:48:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 18:48:25,146 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 89 [2018-12-03 18:48:25,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:25,146 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 18:48:25,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:48:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 18:48:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 18:48:25,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:25,147 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 18:48:25,147 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:25,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1719056153, now seen corresponding path program 32 times [2018-12-03 18:48:25,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:25,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:25,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:25,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:25,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 18:48:25,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:25,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:25,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:25,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:25,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:25,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:25,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:25,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 18:48:25,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:25,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:26,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 18:48:26,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 18:48:27,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:27,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 18:48:27,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:27,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:48:27,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:48:27,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:48:27,536 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 48 states. [2018-12-03 18:48:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:27,789 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2018-12-03 18:48:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:48:27,789 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 18:48:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:27,790 INFO L225 Difference]: With dead ends: 124 [2018-12-03 18:48:27,790 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 18:48:27,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:48:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 18:48:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 18:48:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 18:48:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-12-03 18:48:27,800 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 91 [2018-12-03 18:48:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:27,801 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-12-03 18:48:27,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:48:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-12-03 18:48:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 18:48:27,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:27,802 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 18:48:27,802 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:27,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1513704373, now seen corresponding path program 33 times [2018-12-03 18:48:27,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:27,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:27,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:48:28,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:28,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:28,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:28,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:28,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:28,431 INFO 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 18:48:28,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:28,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:28,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:28,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:28,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:48:28,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:48:29,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:29,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 18:48:29,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:29,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:48:29,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:48:29,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:29,303 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 36 states. [2018-12-03 18:48:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:29,411 INFO L93 Difference]: Finished difference Result 127 states and 154 transitions. [2018-12-03 18:48:29,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:48:29,411 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 18:48:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:29,412 INFO L225 Difference]: With dead ends: 127 [2018-12-03 18:48:29,412 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 18:48:29,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 18:48:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 18:48:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 18:48:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 18:48:29,422 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 95 [2018-12-03 18:48:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:29,422 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 18:48:29,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:48:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 18:48:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 18:48:29,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:29,423 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 18:48:29,423 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:29,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:29,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1584691739, now seen corresponding path program 34 times [2018-12-03 18:48:29,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:29,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:29,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:29,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:29,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:48:30,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:30,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:30,072 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:30,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 18:48:30,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:30,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 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 18:48:30,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:30,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:30,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:48:30,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:48:31,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:31,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 18:48:31,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:31,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:48:31,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:48:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:31,194 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 37 states. [2018-12-03 18:48:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:31,333 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2018-12-03 18:48:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:48:31,333 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 18:48:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:31,334 INFO L225 Difference]: With dead ends: 129 [2018-12-03 18:48:31,334 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 18:48:31,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 18:48:31,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 18:48:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:48:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 18:48:31,346 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 97 [2018-12-03 18:48:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:31,346 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 18:48:31,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:48:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 18:48:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:48:31,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:31,347 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 18:48:31,347 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:31,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:31,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1084073729, now seen corresponding path program 35 times [2018-12-03 18:48:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:31,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:31,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:31,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:31,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 18:48:32,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:32,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:32,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:32,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:32,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:32,139 INFO 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 18:48:32,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:32,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:32,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 18:48:32,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:32,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:32,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 18:48:32,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 18:48:33,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:33,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 18:48:33,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:33,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:48:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:48:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:48:33,224 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 52 states. [2018-12-03 18:48:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:33,495 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2018-12-03 18:48:33,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:48:33,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 18:48:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:33,496 INFO L225 Difference]: With dead ends: 134 [2018-12-03 18:48:33,497 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 18:48:33,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:48:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 18:48:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 18:48:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 18:48:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2018-12-03 18:48:33,505 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 99 [2018-12-03 18:48:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:33,505 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2018-12-03 18:48:33,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:48:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2018-12-03 18:48:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 18:48:33,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:33,506 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 18:48:33,507 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:33,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1372895921, now seen corresponding path program 36 times [2018-12-03 18:48:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:33,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:33,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:48:34,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:34,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:34,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:34,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:34,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:34,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:34,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:34,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:34,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:34,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:34,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:48:34,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:35,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:48:35,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:35,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 18:48:35,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:35,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:48:35,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:48:35,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:35,180 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand 39 states. [2018-12-03 18:48:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:35,426 INFO L93 Difference]: Finished difference Result 137 states and 166 transitions. [2018-12-03 18:48:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:48:35,426 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 18:48:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:35,427 INFO L225 Difference]: With dead ends: 137 [2018-12-03 18:48:35,427 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 18:48:35,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 18:48:35,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 18:48:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 18:48:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 18:48:35,439 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 103 [2018-12-03 18:48:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:35,439 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 18:48:35,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:48:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 18:48:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 18:48:35,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:35,440 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 18:48:35,440 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:35,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:35,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1499681355, now seen corresponding path program 37 times [2018-12-03 18:48:35,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:35,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:35,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:35,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:35,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:48:36,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:36,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:36,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:36,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:36,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:36,291 INFO 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 18:48:36,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:36,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:36,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:48:36,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:48:37,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:37,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 18:48:37,231 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:37,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:48:37,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:48:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:37,233 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 40 states. [2018-12-03 18:48:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:37,420 INFO L93 Difference]: Finished difference Result 139 states and 168 transitions. [2018-12-03 18:48:37,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:48:37,420 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 18:48:37,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:37,421 INFO L225 Difference]: With dead ends: 139 [2018-12-03 18:48:37,421 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 18:48:37,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 18:48:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 18:48:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 18:48:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 18:48:37,431 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 105 [2018-12-03 18:48:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:37,432 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 18:48:37,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:48:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 18:48:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 18:48:37,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:37,432 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 18:48:37,432 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:37,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1213568155, now seen corresponding path program 38 times [2018-12-03 18:48:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:37,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:37,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 18:48:38,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:38,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:38,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:38,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:38,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:38,152 INFO 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 18:48:38,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:38,162 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:38,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 18:48:38,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:38,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 18:48:38,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:39,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 18:48:39,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:39,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 18:48:39,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:39,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 18:48:39,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 18:48:39,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:48:39,372 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 56 states. [2018-12-03 18:48:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:39,643 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2018-12-03 18:48:39,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:48:39,643 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 18:48:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:39,645 INFO L225 Difference]: With dead ends: 144 [2018-12-03 18:48:39,645 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 18:48:39,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 18:48:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 18:48:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 18:48:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 18:48:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-12-03 18:48:39,658 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 107 [2018-12-03 18:48:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:39,658 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-12-03 18:48:39,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 18:48:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-12-03 18:48:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 18:48:39,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:39,659 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 18:48:39,659 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:39,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1153494633, now seen corresponding path program 39 times [2018-12-03 18:48:39,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:39,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:39,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:39,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:48:40,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:40,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:40,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:40,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:40,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:40,760 INFO 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 18:48:40,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:40,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:40,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:40,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:40,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:48:40,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:48:41,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:41,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 18:48:41,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:41,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:48:41,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:48:41,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:41,957 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 42 states. [2018-12-03 18:48:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:42,418 INFO L93 Difference]: Finished difference Result 147 states and 178 transitions. [2018-12-03 18:48:42,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:48:42,418 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 18:48:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:42,419 INFO L225 Difference]: With dead ends: 147 [2018-12-03 18:48:42,419 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 18:48:42,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:42,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 18:48:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 18:48:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 18:48:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 18:48:42,430 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 111 [2018-12-03 18:48:42,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:42,430 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 18:48:42,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:48:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 18:48:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 18:48:42,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:42,431 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 18:48:42,431 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:42,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:42,431 INFO L82 PathProgramCache]: Analyzing trace with hash 479105231, now seen corresponding path program 40 times [2018-12-03 18:48:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:42,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:42,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:42,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:42,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:48:43,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:43,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:43,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:43,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:43,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:43,804 INFO 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 18:48:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:43,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:43,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:48:43,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:48:44,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 18:48:44,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:44,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:48:44,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:48:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:44,972 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 43 states. [2018-12-03 18:48:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:45,694 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2018-12-03 18:48:45,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:48:45,695 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 18:48:45,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:45,696 INFO L225 Difference]: With dead ends: 149 [2018-12-03 18:48:45,696 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 18:48:45,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 18:48:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 18:48:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 18:48:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 18:48:45,710 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 113 [2018-12-03 18:48:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:45,711 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 18:48:45,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:48:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 18:48:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 18:48:45,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:45,712 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 18:48:45,712 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:45,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash 930951605, now seen corresponding path program 41 times [2018-12-03 18:48:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:45,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:45,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 18:48:46,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:46,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:46,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:46,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:46,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:46,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:46,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:46,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:46,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 18:48:46,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:46,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 18:48:47,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 18:48:48,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:48,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 18:48:48,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:48,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 18:48:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 18:48:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:48:48,069 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 60 states. [2018-12-03 18:48:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:48,379 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2018-12-03 18:48:48,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:48:48,380 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 18:48:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:48,381 INFO L225 Difference]: With dead ends: 154 [2018-12-03 18:48:48,381 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 18:48:48,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:48:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 18:48:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 18:48:48,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 18:48:48,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2018-12-03 18:48:48,396 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 115 [2018-12-03 18:48:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:48,396 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2018-12-03 18:48:48,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 18:48:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2018-12-03 18:48:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 18:48:48,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:48,397 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 18:48:48,398 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:48,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:48,398 INFO L82 PathProgramCache]: Analyzing trace with hash 473851651, now seen corresponding path program 42 times [2018-12-03 18:48:48,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:48,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:48,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:48,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:48:49,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:49,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:49,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:49,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:49,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:49,532 INFO 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 18:48:49,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:49,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:49,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:49,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:49,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:48:49,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:48:50,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:50,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 18:48:50,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:50,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:48:50,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:48:50,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:50,840 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 45 states. [2018-12-03 18:48:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:51,020 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2018-12-03 18:48:51,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:48:51,027 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 18:48:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:51,028 INFO L225 Difference]: With dead ends: 157 [2018-12-03 18:48:51,028 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 18:48:51,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:51,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 18:48:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 18:48:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 18:48:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 18:48:51,041 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 119 [2018-12-03 18:48:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:51,041 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 18:48:51,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:48:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 18:48:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 18:48:51,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:51,042 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 18:48:51,043 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:51,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 948847465, now seen corresponding path program 43 times [2018-12-03 18:48:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:51,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:51,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:51,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:51,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:48:51,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:51,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:51,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:51,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:51,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:51,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:51,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:51,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:51,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:48:51,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:48:52,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:53,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 18:48:53,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:53,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:48:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:48:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:53,001 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 46 states. [2018-12-03 18:48:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:53,205 INFO L93 Difference]: Finished difference Result 159 states and 192 transitions. [2018-12-03 18:48:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:48:53,206 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 18:48:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:53,207 INFO L225 Difference]: With dead ends: 159 [2018-12-03 18:48:53,207 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 18:48:53,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 18:48:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 18:48:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 18:48:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 18:48:53,221 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 121 [2018-12-03 18:48:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:53,221 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 18:48:53,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:48:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 18:48:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 18:48:53,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:53,222 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 18:48:53,222 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2141675953, now seen corresponding path program 44 times [2018-12-03 18:48:53,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:53,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:53,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:53,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:53,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 18:48:54,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:54,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:54,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:54,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:54,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:54,077 INFO 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 18:48:54,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:48:54,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:48:54,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 18:48:54,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:54,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 18:48:54,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 18:48:55,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:55,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 18:48:55,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:55,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 18:48:55,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 18:48:55,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:48:55,663 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 64 states. [2018-12-03 18:48:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:56,281 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2018-12-03 18:48:56,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:48:56,282 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 18:48:56,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:56,283 INFO L225 Difference]: With dead ends: 164 [2018-12-03 18:48:56,283 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 18:48:56,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 18:48:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 18:48:56,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 18:48:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 18:48:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2018-12-03 18:48:56,295 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 123 [2018-12-03 18:48:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:56,295 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-12-03 18:48:56,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 18:48:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2018-12-03 18:48:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 18:48:56,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:56,296 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 18:48:56,296 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:56,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:56,297 INFO L82 PathProgramCache]: Analyzing trace with hash 543149853, now seen corresponding path program 45 times [2018-12-03 18:48:56,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:56,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:56,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:56,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:48:57,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:57,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:57,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:57,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:57,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:57,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:48:57,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:48:57,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:48:57,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:48:57,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:48:57,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:48:57,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:48:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:48:58,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:48:58,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 18:48:58,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:48:58,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:48:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:48:58,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:58,246 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 48 states. [2018-12-03 18:48:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:48:58,418 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2018-12-03 18:48:58,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:48:58,419 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 18:48:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:48:58,420 INFO L225 Difference]: With dead ends: 167 [2018-12-03 18:48:58,420 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 18:48:58,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:48:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 18:48:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 18:48:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 18:48:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 18:48:58,431 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 127 [2018-12-03 18:48:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:48:58,431 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 18:48:58,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:48:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 18:48:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 18:48:58,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:48:58,432 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 18:48:58,432 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:48:58,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:48:58,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1616373123, now seen corresponding path program 46 times [2018-12-03 18:48:58,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:48:58,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:58,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:48:58,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:48:58,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:48:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:48:59,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:59,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:48:59,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:48:59,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:48:59,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:48:59,507 INFO 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 18:48:59,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:48:59,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:48:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:48:59,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:48:59,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:48:59,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:49:00,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:00,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 18:49:00,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:00,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:49:00,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:49:00,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:00,530 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 49 states. [2018-12-03 18:49:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:00,860 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2018-12-03 18:49:00,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:49:00,860 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 18:49:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:00,861 INFO L225 Difference]: With dead ends: 169 [2018-12-03 18:49:00,861 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 18:49:00,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 18:49:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 18:49:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 18:49:00,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 18:49:00,873 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 129 [2018-12-03 18:49:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:00,874 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 18:49:00,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:49:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 18:49:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 18:49:00,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:00,875 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 18:49:00,875 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:00,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2103182743, now seen corresponding path program 47 times [2018-12-03 18:49:00,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:00,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:00,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 18:49:02,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:02,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:02,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:02,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:02,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:02,098 INFO 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 18:49:02,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:02,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:02,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 18:49:02,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:02,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 18:49:02,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 18:49:03,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:03,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 18:49:03,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:03,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 18:49:03,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 18:49:03,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:49:03,930 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 68 states. [2018-12-03 18:49:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:04,869 INFO L93 Difference]: Finished difference Result 174 states and 212 transitions. [2018-12-03 18:49:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:49:04,870 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 18:49:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:04,871 INFO L225 Difference]: With dead ends: 174 [2018-12-03 18:49:04,871 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 18:49:04,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 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 18:49:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 18:49:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 18:49:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 18:49:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2018-12-03 18:49:04,887 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 131 [2018-12-03 18:49:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:04,887 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-12-03 18:49:04,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 18:49:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2018-12-03 18:49:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 18:49:04,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:04,888 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 18:49:04,888 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:04,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1403435337, now seen corresponding path program 48 times [2018-12-03 18:49:04,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:04,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:04,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:04,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:49:07,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:07,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:07,019 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:07,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:07,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:07,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:07,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:07,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:07,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:07,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:07,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:49:07,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:49:08,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:08,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 18:49:08,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:08,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:49:08,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:49:08,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:08,057 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 51 states. [2018-12-03 18:49:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:08,446 INFO L93 Difference]: Finished difference Result 177 states and 214 transitions. [2018-12-03 18:49:08,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:49:08,447 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 18:49:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:08,448 INFO L225 Difference]: With dead ends: 177 [2018-12-03 18:49:08,448 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 18:49:08,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 18:49:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 18:49:08,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 18:49:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 18:49:08,460 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 135 [2018-12-03 18:49:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:08,460 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 18:49:08,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:49:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 18:49:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 18:49:08,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:08,461 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 18:49:08,461 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:08,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1763677981, now seen corresponding path program 49 times [2018-12-03 18:49:08,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:08,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:08,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:08,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:08,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:49:09,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:09,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:09,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:09,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:09,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:09,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:09,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:09,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:09,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:49:09,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 18:49:12,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:12,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 18:49:12,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:12,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:49:12,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:49:12,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:12,215 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 52 states. [2018-12-03 18:49:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:12,434 INFO L93 Difference]: Finished difference Result 179 states and 216 transitions. [2018-12-03 18:49:12,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:49:12,434 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 18:49:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:12,436 INFO L225 Difference]: With dead ends: 179 [2018-12-03 18:49:12,436 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 18:49:12,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 18:49:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 18:49:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 18:49:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 18:49:12,451 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 137 [2018-12-03 18:49:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:12,451 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 18:49:12,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:49:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 18:49:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 18:49:12,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:12,452 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 18:49:12,453 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:12,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:12,453 INFO L82 PathProgramCache]: Analyzing trace with hash 227763715, now seen corresponding path program 50 times [2018-12-03 18:49:12,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:12,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:12,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:13,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:13,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:13,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:13,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:13,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:13,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:13,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:13,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:13,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 18:49:13,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:13,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:13,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:14,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:14,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 18:49:14,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:14,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:49:14,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:49:14,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:49:14,176 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 23 states. [2018-12-03 18:49:14,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:14,275 INFO L93 Difference]: Finished difference Result 149 states and 173 transitions. [2018-12-03 18:49:14,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:49:14,276 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 18:49:14,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:14,277 INFO L225 Difference]: With dead ends: 149 [2018-12-03 18:49:14,277 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 18:49:14,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:49:14,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 18:49:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-12-03 18:49:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 18:49:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 167 transitions. [2018-12-03 18:49:14,293 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 167 transitions. Word has length 139 [2018-12-03 18:49:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:14,294 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 167 transitions. [2018-12-03 18:49:14,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:49:14,294 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 167 transitions. [2018-12-03 18:49:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 18:49:14,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:14,295 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 18:49:14,295 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:14,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2102700987, now seen corresponding path program 51 times [2018-12-03 18:49:14,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:14,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:14,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:14,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:14,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:15,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:15,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:15,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:15,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:15,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:15,753 INFO 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 18:49:15,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:15,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:15,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:15,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:15,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:17,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:19,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:19,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 18:49:19,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:19,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 18:49:19,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 18:49:19,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:19,426 INFO L87 Difference]: Start difference. First operand 146 states and 167 transitions. Second operand 76 states. [2018-12-03 18:49:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:19,879 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2018-12-03 18:49:19,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 18:49:19,879 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 18:49:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:19,881 INFO L225 Difference]: With dead ends: 155 [2018-12-03 18:49:19,881 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 18:49:19,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 18:49:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-12-03 18:49:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 18:49:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2018-12-03 18:49:19,896 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 145 [2018-12-03 18:49:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:19,897 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2018-12-03 18:49:19,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 18:49:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2018-12-03 18:49:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 18:49:19,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:19,898 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 18:49:19,898 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:19,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1808320371, now seen corresponding path program 52 times [2018-12-03 18:49:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:19,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:19,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:21,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:21,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:21,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:21,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:21,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:21,058 INFO 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 18:49:21,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:21,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:21,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:22,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:24,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:24,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 18:49:24,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:24,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:49:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:49:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:24,489 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand 79 states. [2018-12-03 18:49:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:24,999 INFO L93 Difference]: Finished difference Result 161 states and 191 transitions. [2018-12-03 18:49:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 18:49:24,999 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 18:49:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:25,000 INFO L225 Difference]: With dead ends: 161 [2018-12-03 18:49:25,000 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 18:49:25,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:25,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 18:49:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-12-03 18:49:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 18:49:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2018-12-03 18:49:25,012 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 151 [2018-12-03 18:49:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:25,012 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2018-12-03 18:49:25,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:49:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2018-12-03 18:49:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 18:49:25,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:25,013 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 18:49:25,013 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:25,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash 16202027, now seen corresponding path program 53 times [2018-12-03 18:49:25,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:25,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:25,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:25,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:25,014 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:25,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:25,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:25,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:25,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:25,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:25,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:25,578 INFO 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 18:49:25,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:25,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:25,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 18:49:25,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:25,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:25,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:26,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:26,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 18:49:26,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:26,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:49:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:49:26,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:26,715 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand 32 states. [2018-12-03 18:49:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:26,876 INFO L93 Difference]: Finished difference Result 167 states and 200 transitions. [2018-12-03 18:49:26,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:49:26,877 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 18:49:26,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:26,878 INFO L225 Difference]: With dead ends: 167 [2018-12-03 18:49:26,878 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 18:49:26,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 18:49:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-12-03 18:49:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 18:49:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2018-12-03 18:49:26,888 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 157 [2018-12-03 18:49:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:26,889 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2018-12-03 18:49:26,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:49:26,889 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2018-12-03 18:49:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 18:49:26,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:26,889 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 18:49:26,890 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:26,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:26,890 INFO L82 PathProgramCache]: Analyzing trace with hash 558334179, now seen corresponding path program 54 times [2018-12-03 18:49:26,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:26,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:26,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:26,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:26,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:27,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:27,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:27,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:27,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:27,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:27,737 INFO 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 18:49:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:27,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:27,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:27,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:27,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:28,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:30,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:30,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 18:49:30,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:30,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:49:30,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:49:30,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:30,676 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 85 states. [2018-12-03 18:49:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:31,240 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2018-12-03 18:49:31,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 18:49:31,240 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 18:49:31,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:31,241 INFO L225 Difference]: With dead ends: 173 [2018-12-03 18:49:31,241 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 18:49:31,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 18:49:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-12-03 18:49:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 18:49:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 203 transitions. [2018-12-03 18:49:31,252 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 203 transitions. Word has length 163 [2018-12-03 18:49:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:31,252 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 203 transitions. [2018-12-03 18:49:31,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:49:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 203 transitions. [2018-12-03 18:49:31,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 18:49:31,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:31,253 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 18:49:31,253 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:31,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1518264677, now seen corresponding path program 55 times [2018-12-03 18:49:31,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:31,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:31,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:32,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:32,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:32,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:32,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 18:49:32,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:32,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 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 18:49:32,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:32,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:32,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:33,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:35,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:35,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 18:49:35,016 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:35,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 18:49:35,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 18:49:35,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:35,017 INFO L87 Difference]: Start difference. First operand 170 states and 203 transitions. Second operand 88 states. [2018-12-03 18:49:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:35,755 INFO L93 Difference]: Finished difference Result 179 states and 218 transitions. [2018-12-03 18:49:35,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 18:49:35,755 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 18:49:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:35,756 INFO L225 Difference]: With dead ends: 179 [2018-12-03 18:49:35,756 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 18:49:35,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 18:49:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-12-03 18:49:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 18:49:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2018-12-03 18:49:35,768 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 169 [2018-12-03 18:49:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:35,769 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2018-12-03 18:49:35,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 18:49:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2018-12-03 18:49:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 18:49:35,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:35,770 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 18:49:35,770 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:35,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1832152493, now seen corresponding path program 56 times [2018-12-03 18:49:35,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:35,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:35,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:35,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:35,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:36,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:36,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:36,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:36,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:36,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:36,502 INFO 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 18:49:36,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:36,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:36,604 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 18:49:36,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:36,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:36,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:37,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:37,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 18:49:37,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:37,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:49:37,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:49:37,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:37,752 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand 41 states. [2018-12-03 18:49:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:38,002 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-12-03 18:49:38,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:49:38,002 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 18:49:38,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:38,004 INFO L225 Difference]: With dead ends: 185 [2018-12-03 18:49:38,004 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 18:49:38,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 18:49:38,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-12-03 18:49:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 18:49:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 221 transitions. [2018-12-03 18:49:38,016 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 221 transitions. Word has length 175 [2018-12-03 18:49:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:38,016 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 221 transitions. [2018-12-03 18:49:38,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:49:38,016 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 221 transitions. [2018-12-03 18:49:38,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 18:49:38,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:38,017 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 18:49:38,018 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:38,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1387158539, now seen corresponding path program 57 times [2018-12-03 18:49:38,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:38,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:38,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:38,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:38,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:38,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:38,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:38,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:38,736 INFO 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 18:49:38,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:38,746 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:38,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:38,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:38,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:39,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:41,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:41,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 18:49:41,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:41,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 18:49:41,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 18:49:41,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:41,583 INFO L87 Difference]: Start difference. First operand 182 states and 221 transitions. Second operand 94 states. [2018-12-03 18:49:42,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:42,402 INFO L93 Difference]: Finished difference Result 191 states and 236 transitions. [2018-12-03 18:49:42,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 18:49:42,403 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 18:49:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:42,404 INFO L225 Difference]: With dead ends: 191 [2018-12-03 18:49:42,404 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 18:49:42,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 18:49:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-12-03 18:49:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 18:49:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2018-12-03 18:49:42,419 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 181 [2018-12-03 18:49:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:42,420 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2018-12-03 18:49:42,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 18:49:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2018-12-03 18:49:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 18:49:42,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:42,421 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 18:49:42,421 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:42,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash -351208509, now seen corresponding path program 58 times [2018-12-03 18:49:42,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:42,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:42,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:42,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:43,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:43,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:43,343 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:43,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:43,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:43,343 INFO 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 18:49:43,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:43,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:43,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:44,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:46,560 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:46,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:46,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 18:49:46,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:46,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 18:49:46,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 18:49:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:46,581 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 97 states. [2018-12-03 18:49:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:47,485 INFO L93 Difference]: Finished difference Result 197 states and 245 transitions. [2018-12-03 18:49:47,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 18:49:47,485 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 18:49:47,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:47,486 INFO L225 Difference]: With dead ends: 197 [2018-12-03 18:49:47,486 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 18:49:47,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 18:49:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-12-03 18:49:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 18:49:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2018-12-03 18:49:47,499 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 187 [2018-12-03 18:49:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:47,500 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2018-12-03 18:49:47,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 18:49:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2018-12-03 18:49:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 18:49:47,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:47,501 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 18:49:47,501 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:47,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:47,501 INFO L82 PathProgramCache]: Analyzing trace with hash 909832571, now seen corresponding path program 59 times [2018-12-03 18:49:47,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:47,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:47,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:47,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 18:49:48,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:48,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:48,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:48,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:48,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:48,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:48,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:49:48,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:49:48,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 18:49:48,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:48,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:48,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:49,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:49,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 18:49:49,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:49,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:49:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:49:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:49,553 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand 50 states. [2018-12-03 18:49:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:49,898 INFO L93 Difference]: Finished difference Result 203 states and 254 transitions. [2018-12-03 18:49:49,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:49:49,899 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 18:49:49,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:49,900 INFO L225 Difference]: With dead ends: 203 [2018-12-03 18:49:49,900 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 18:49:49,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:49:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 18:49:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-12-03 18:49:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 18:49:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 248 transitions. [2018-12-03 18:49:49,917 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 248 transitions. Word has length 193 [2018-12-03 18:49:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:49,918 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 248 transitions. [2018-12-03 18:49:49,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:49:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 248 transitions. [2018-12-03 18:49:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 18:49:49,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:49,919 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 18:49:49,919 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:49,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 450084147, now seen corresponding path program 60 times [2018-12-03 18:49:49,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:49,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:49,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:49,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:50,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:50,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:50,914 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:50,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:50,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:50,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 18:49:50,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:49:50,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:49:50,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:49:50,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:49:50,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:52,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:49:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:54,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:49:54,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 18:49:54,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:49:54,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 18:49:54,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 18:49:54,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:54,196 INFO L87 Difference]: Start difference. First operand 200 states and 248 transitions. Second operand 101 states. [2018-12-03 18:49:55,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:49:55,263 INFO L93 Difference]: Finished difference Result 205 states and 255 transitions. [2018-12-03 18:49:55,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 18:49:55,263 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 18:49:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:49:55,265 INFO L225 Difference]: With dead ends: 205 [2018-12-03 18:49:55,265 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 18:49:55,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:49:55,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 18:49:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 18:49:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 18:49:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2018-12-03 18:49:55,280 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 199 [2018-12-03 18:49:55,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:49:55,281 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2018-12-03 18:49:55,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 18:49:55,281 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2018-12-03 18:49:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 18:49:55,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:49:55,282 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 18:49:55,282 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:49:55,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:49:55,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1260892901, now seen corresponding path program 61 times [2018-12-03 18:49:55,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:49:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:55,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:49:55,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:49:55,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:49:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 18:49:56,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:56,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:49:56,677 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:49:56,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:49:56,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:49:56,677 INFO 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 18:49:56,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:49:56,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:49:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:49:56,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:49:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:49:58,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:50:00,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:00,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 18:50:00,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:00,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 18:50:00,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 18:50:00,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:50:00,637 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 102 states. [2018-12-03 18:50:01,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:01,598 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2018-12-03 18:50:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 18:50:01,598 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 18:50:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:01,600 INFO L225 Difference]: With dead ends: 206 [2018-12-03 18:50:01,600 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 18:50:01,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:50:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 18:50:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-12-03 18:50:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 18:50:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2018-12-03 18:50:01,613 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 201 [2018-12-03 18:50:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:01,613 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2018-12-03 18:50:01,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 18:50:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2018-12-03 18:50:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 18:50:01,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:01,614 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 18:50:01,614 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:01,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:01,615 INFO L82 PathProgramCache]: Analyzing trace with hash -537361661, now seen corresponding path program 62 times [2018-12-03 18:50:01,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:01,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:50:01,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:01,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:50:03,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:03,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:50:03,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:50:03,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:50:03,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:50:03,585 INFO 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 18:50:03,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:50:03,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:50:03,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 100 check-sat command(s) [2018-12-03 18:50:03,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:50:03,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:50:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:50:03,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:50:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:50:04,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:50:04,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 18:50:04,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:50:04,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:50:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:50:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:50:04,186 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2018-12-03 18:50:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:06,348 INFO L93 Difference]: Finished difference Result 2857 states and 4232 transitions. [2018-12-03 18:50:06,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:50:06,348 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 18:50:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:06,359 INFO L225 Difference]: With dead ends: 2857 [2018-12-03 18:50:06,359 INFO L226 Difference]: Without dead ends: 2855 [2018-12-03 18:50:06,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 401 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 18:50:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-12-03 18:50:06,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 206. [2018-12-03 18:50:06,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 18:50:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2018-12-03 18:50:06,473 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 203 [2018-12-03 18:50:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:06,474 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2018-12-03 18:50:06,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:50:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2018-12-03 18:50:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 18:50:06,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:50:06,475 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1] [2018-12-03 18:50:06,475 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:50:06,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:50:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1008541973, now seen corresponding path program 63 times [2018-12-03 18:50:06,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:50:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:06,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:50:06,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:50:06,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:50:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:50:08,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 18:50:08,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:50:08,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 18:50:08,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:50:08,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:50:08,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:50:08,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:50:08,289 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand 52 states. [2018-12-03 18:50:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:50:08,613 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2018-12-03 18:50:08,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:50:08,613 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 205 [2018-12-03 18:50:08,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:50:08,614 INFO L225 Difference]: With dead ends: 305 [2018-12-03 18:50:08,614 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 18:50:08,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:50:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 18:50:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 18:50:08,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 18:50:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 18:50:08,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2018-12-03 18:50:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:50:08,617 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 18:50:08,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:50:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 18:50:08,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 18:50:08,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 18:50:09,522 WARN L180 SmtUtils]: Spent 887.00 ms on a formula simplification. DAG size of input: 1842 DAG size of output: 400 [2018-12-03 18:50:10,414 WARN L180 SmtUtils]: Spent 885.00 ms on a formula simplification. DAG size of input: 1847 DAG size of output: 407 [2018-12-03 18:50:15,405 WARN L180 SmtUtils]: Spent 4.99 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-12-03 18:50:17,053 WARN L180 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 407 DAG size of output: 357 [2018-12-03 18:50:17,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 44) no Hoare annotation was computed. [2018-12-03 18:50:17,058 INFO L444 ceAbstractionStarter]: At program point L30(lines 30 42) the Hoare annotation is: false [2018-12-03 18:50:17,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 44) no Hoare annotation was computed. [2018-12-03 18:50:17,058 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 44) no Hoare annotation was computed. [2018-12-03 18:50:17,060 INFO L444 ceAbstractionStarter]: At program point L22(lines 22 37) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 18:50:17,060 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2018-12-03 18:50:17,061 INFO L444 ceAbstractionStarter]: At program point L41(lines 15 41) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (<= 61 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (<= 58 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= ULTIMATE.start_main_~y~4 50) (<= ULTIMATE.start_main_~x~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-12-03 18:50:17,083 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:50:17 BoogieIcfgContainer [2018-12-03 18:50:17,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 18:50:17,085 INFO L168 Benchmark]: Toolchain (without parser) took 150613.19 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -121.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 18:50:17,085 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:50:17,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:50:17,086 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 18:50:17,087 INFO L168 Benchmark]: RCFGBuilder took 322.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 18:50:17,087 INFO L168 Benchmark]: TraceAbstraction took 150221.34 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -142.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 18:50:17,089 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.15 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 322.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 150221.34 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -142.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || ((main_~y~4 <= 50 && main_~x~4 <= 50) && 50 <= main_~y~4)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61) && 61 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4) && 58 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || ((main_~y~4 <= 50 && main_~x~4 <= 50) && 50 <= main_~y~4)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 150.1s OverallTime, 65 OverallIterations, 101 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 8.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 332 SDtfs, 1472 SDslu, 6308 SDs, 0 SdLazy, 9761 SolverSat, 2308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 13449 GetRequests, 9198 SyntacticMatches, 1132 SemanticMatches, 3119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125668 ImplicationChecksByTransitivity, 109.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9 AbsIntWeakeningRatio, 0.5 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 65 MinimizatonAttempts, 2678 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 204 NumberOfFragments, 1406 HoareAnnotationTreeSize, 3 FomulaSimplifications, 36128 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 396 FormulaSimplificationTreeSizeReductionInter, 6.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 113.6s InterpolantComputationTime, 11885 NumberOfCodeBlocks, 11293 NumberOfCodeBlocksAsserted, 820 NumberOfCheckSat, 17532 ConstructedInterpolants, 0 QuantifiedInterpolants, 5655520 SizeOfPredicates, 49 NumberOfNonLiveVariables, 12946 ConjunctsInSsa, 2042 ConjunctsInUnsatCore, 189 InterpolantComputations, 2 PerfectInterpolantSequences, 262904/532271 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...