java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:01:06,244 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:01:06,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:01:06,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:01:06,259 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:01:06,260 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:01:06,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:01:06,265 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:01:06,269 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:01:06,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:01:06,272 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:01:06,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:01:06,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:01:06,275 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:01:06,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:01:06,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:01:06,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:01:06,291 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:01:06,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:01:06,298 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:01:06,302 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:01:06,303 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:01:06,309 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:01:06,310 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:01:06,310 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:01:06,311 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:01:06,314 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:01:06,315 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:01:06,316 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:01:06,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:01:06,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:01:06,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:01:06,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:01:06,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:01:06,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:01:06,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:01:06,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:01:06,343 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:01:06,344 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:01:06,345 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:01:06,345 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:01:06,345 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:01:06,346 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:01:06,346 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:01:06,346 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:01:06,346 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:01:06,346 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:01:06,347 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:01:06,347 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:01:06,347 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:01:06,348 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:01:06,348 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:01:06,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:01:06,349 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:01:06,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:01:06,349 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:01:06,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:01:06,351 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:01:06,351 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:01:06,352 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:01:06,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:01:06,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:01:06,352 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:01:06,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:01:06,353 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:01:06,353 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:01:06,353 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:01:06,353 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:01:06,353 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:01:06,354 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:01:06,354 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:01:06,354 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:01:06,354 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:01:06,355 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:01:06,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:01:06,355 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:01:06,355 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:01:06,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:01:06,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:01:06,417 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:01:06,419 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:01:06,419 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:01:06,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2019-01-11 11:01:06,420 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2019-01-11 11:01:06,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:01:06,479 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:01:06,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:06,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:01:06,480 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:01:06,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,523 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 11:01:06,523 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 11:01:06,523 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 11:01:06,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:06,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:01:06,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:01:06,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:01:06,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:01:06,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:01:06,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:01:06,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:01:06,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:01:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 11:01:06,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 11:01:06,642 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-11 11:01:06,890 INFO L278 CfgBuilder]: Using library mode [2019-01-11 11:01:06,891 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-11 11:01:06,892 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:06 BoogieIcfgContainer [2019-01-11 11:01:06,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:01:06,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:01:06,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:01:06,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:01:06,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/2) ... [2019-01-11 11:01:06,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac4d638 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:01:06, skipping insertion in model container [2019-01-11 11:01:06,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:06" (2/2) ... [2019-01-11 11:01:06,900 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2019-01-11 11:01:06,911 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:01:06,919 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 11:01:06,939 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 11:01:07,007 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:01:07,010 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:01:07,010 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:01:07,010 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:01:07,010 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:01:07,011 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:01:07,011 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:01:07,011 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:01:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-01-11 11:01:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:01:07,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:07,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:01:07,062 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:07,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:07,075 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-11 11:01:07,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:07,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:01:07,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:07,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:01:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:01:07,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:01:07,323 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-01-11 11:01:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:07,381 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-11 11:01:07,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:01:07,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 11:01:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:07,395 INFO L225 Difference]: With dead ends: 17 [2019-01-11 11:01:07,395 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 11:01:07,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:01:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 11:01:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-11 11:01:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 11:01:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-11 11:01:07,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2019-01-11 11:01:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:07,437 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-11 11:01:07,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:01:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-11 11:01:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:01:07,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:07,438 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-11 11:01:07,438 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:07,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:07,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2019-01-11 11:01:07,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:07,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:07,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:07,641 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:01:07,643 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [8], [9], [13] [2019-01-11 11:01:07,700 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:01:07,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:01:07,872 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:01:07,873 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 5 different actions 10 times. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:01:07,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:07,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:01:07,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,881 INFO L193 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 [2019-01-11 11:01:07,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:07,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:08,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:08,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:01:08,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:08,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:01:08,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:01:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:01:08,224 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-01-11 11:01:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:08,365 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-11 11:01:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:01:08,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-01-11 11:01:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:08,366 INFO L225 Difference]: With dead ends: 15 [2019-01-11 11:01:08,366 INFO L226 Difference]: Without dead ends: 14 [2019-01-11 11:01:08,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:01:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-11 11:01:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-11 11:01:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 11:01:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-11 11:01:08,372 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2019-01-11 11:01:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:08,373 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-11 11:01:08,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:01:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-11 11:01:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 11:01:08,374 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:08,374 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2019-01-11 11:01:08,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2019-01-11 11:01:08,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:08,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:08,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:08,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:08,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,645 INFO L193 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 [2019-01-11 11:01:08,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:08,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:08,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:01:08,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:08,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:08,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:08,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:01:08,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:08,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:01:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:01:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:01:08,976 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2019-01-11 11:01:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:09,119 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-11 11:01:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:01:09,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-11 11:01:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:09,121 INFO L225 Difference]: With dead ends: 19 [2019-01-11 11:01:09,121 INFO L226 Difference]: Without dead ends: 18 [2019-01-11 11:01:09,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:01:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-11 11:01:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-11 11:01:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:01:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-11 11:01:09,125 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2019-01-11 11:01:09,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:09,126 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-11 11:01:09,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:01:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-11 11:01:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 11:01:09,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:09,127 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2019-01-11 11:01:09,127 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:09,128 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2019-01-11 11:01:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:09,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:09,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:09,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:09,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,246 INFO L193 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 [2019-01-11 11:01:09,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:09,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:09,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:09,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:09,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:09,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:09,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:09,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:09,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:09,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:01:09,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:09,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:01:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:01:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:01:09,547 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-11 11:01:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:09,869 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-11 11:01:09,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:01:09,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-11 11:01:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:09,871 INFO L225 Difference]: With dead ends: 23 [2019-01-11 11:01:09,871 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 11:01:09,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:01:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 11:01:09,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-11 11:01:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:01:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-11 11:01:09,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-01-11 11:01:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:09,877 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-11 11:01:09,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:01:09,878 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-11 11:01:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:01:09,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:09,878 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2019-01-11 11:01:09,879 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:09,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:09,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2019-01-11 11:01:09,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:09,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:09,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:10,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:10,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:10,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,010 INFO L193 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 [2019-01-11 11:01:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:10,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:10,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:10,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:10,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:01:10,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:10,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:01:10,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:01:10,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:10,309 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-11 11:01:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:10,380 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-11 11:01:10,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:01:10,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-11 11:01:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:10,381 INFO L225 Difference]: With dead ends: 27 [2019-01-11 11:01:10,381 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 11:01:10,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 11:01:10,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-11 11:01:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 11:01:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-11 11:01:10,387 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2019-01-11 11:01:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:10,387 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-11 11:01:10,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:01:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-11 11:01:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 11:01:10,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:10,389 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2019-01-11 11:01:10,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2019-01-11 11:01:10,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:10,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,542 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:10,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:10,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:10,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,543 INFO L193 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 [2019-01-11 11:01:10,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:10,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:10,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 11:01:10,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:10,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:10,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:10,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:10,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:01:10,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:10,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:01:10,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:01:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:01:10,948 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2019-01-11 11:01:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:11,010 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-11 11:01:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:01:11,010 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-01-11 11:01:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:11,012 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:01:11,012 INFO L226 Difference]: Without dead ends: 30 [2019-01-11 11:01:11,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:01:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-11 11:01:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-11 11:01:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 11:01:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-11 11:01:11,018 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2019-01-11 11:01:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:11,018 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-11 11:01:11,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:01:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-11 11:01:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 11:01:11,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:11,020 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2019-01-11 11:01:11,020 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:11,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:11,020 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2019-01-11 11:01:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:11,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:11,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:11,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:11,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:11,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:11,321 INFO L193 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 [2019-01-11 11:01:11,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:11,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:11,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:11,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:11,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:11,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:11,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:11,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:11,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:11,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-11 11:01:11,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:11,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:01:11,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:01:11,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:11,786 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2019-01-11 11:01:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:11,860 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-11 11:01:11,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:01:11,861 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2019-01-11 11:01:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:11,863 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:01:11,863 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 11:01:11,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 11:01:11,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-01-11 11:01:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:01:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-11 11:01:11,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2019-01-11 11:01:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:11,869 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-11 11:01:11,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:01:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-11 11:01:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 11:01:11,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:11,871 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2019-01-11 11:01:11,871 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:11,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:11,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2019-01-11 11:01:11,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:11,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:12,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:12,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:12,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:12,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:12,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:12,121 INFO L193 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 [2019-01-11 11:01:12,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:12,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:12,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:12,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:12,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:12,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:12,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:12,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:12,739 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:12,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:12,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-11 11:01:12,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:12,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 11:01:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 11:01:12,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:01:12,759 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2019-01-11 11:01:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:12,984 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-11 11:01:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:01:12,985 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-01-11 11:01:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:12,986 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:01:12,986 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 11:01:12,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:01:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 11:01:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-01-11 11:01:12,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:01:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-11 11:01:12,993 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2019-01-11 11:01:12,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:12,994 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-11 11:01:12,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 11:01:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-11 11:01:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 11:01:12,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:12,995 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2019-01-11 11:01:12,996 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:12,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2019-01-11 11:01:12,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:12,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:12,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:12,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:13,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:13,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:13,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,237 INFO L193 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 [2019-01-11 11:01:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:13,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:13,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 11:01:13,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:13,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:13,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:13,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:13,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-11 11:01:13,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:13,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 11:01:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 11:01:13,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:01:13,878 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2019-01-11 11:01:13,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:13,984 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-11 11:01:13,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:01:13,985 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-01-11 11:01:13,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:13,986 INFO L225 Difference]: With dead ends: 43 [2019-01-11 11:01:13,986 INFO L226 Difference]: Without dead ends: 42 [2019-01-11 11:01:13,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:01:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-11 11:01:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-01-11 11:01:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:01:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-11 11:01:13,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2019-01-11 11:01:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:13,993 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-11 11:01:13,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 11:01:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-11 11:01:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 11:01:13,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:13,994 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2019-01-11 11:01:13,994 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:13,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2019-01-11 11:01:13,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:14,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:14,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:14,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:14,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:14,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:14,244 INFO L193 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 [2019-01-11 11:01:14,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:14,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:14,275 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:14,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:14,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:14,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:14,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:14,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:14,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:14,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:14,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:14,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-11 11:01:14,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:14,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:01:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:01:14,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:01:14,763 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2019-01-11 11:01:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:14,930 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-11 11:01:14,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:01:14,930 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2019-01-11 11:01:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:14,931 INFO L225 Difference]: With dead ends: 47 [2019-01-11 11:01:14,931 INFO L226 Difference]: Without dead ends: 46 [2019-01-11 11:01:14,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:01:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-11 11:01:14,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-01-11 11:01:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:01:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-11 11:01:14,937 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2019-01-11 11:01:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:14,938 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-11 11:01:14,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:01:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-11 11:01:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 11:01:14,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:14,939 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2019-01-11 11:01:14,939 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:14,940 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2019-01-11 11:01:14,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:14,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:15,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:15,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:15,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,307 INFO L193 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 [2019-01-11 11:01:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:15,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:15,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:15,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:15,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:15,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:15,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:15,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-11 11:01:15,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:15,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 11:01:15,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 11:01:15,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:01:15,839 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2019-01-11 11:01:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:15,920 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-11 11:01:15,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:01:15,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-01-11 11:01:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:15,921 INFO L225 Difference]: With dead ends: 51 [2019-01-11 11:01:15,921 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 11:01:15,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:01:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 11:01:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-01-11 11:01:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 11:01:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-11 11:01:15,926 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2019-01-11 11:01:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:15,926 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-11 11:01:15,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 11:01:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-11 11:01:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 11:01:15,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:15,928 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2019-01-11 11:01:15,928 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2019-01-11 11:01:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:16,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:16,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:16,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:16,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,148 INFO L193 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 [2019-01-11 11:01:16,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:16,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:16,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-11 11:01:16,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:16,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:16,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:16,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:16,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:16,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:16,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:16,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-11 11:01:16,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:16,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:01:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:01:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:16,801 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2019-01-11 11:01:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:16,906 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-11 11:01:16,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:01:16,907 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2019-01-11 11:01:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:16,908 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:01:16,908 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 11:01:16,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 11:01:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-01-11 11:01:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 11:01:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-11 11:01:16,914 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2019-01-11 11:01:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:16,914 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-11 11:01:16,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:01:16,915 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-11 11:01:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 11:01:16,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:16,916 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2019-01-11 11:01:16,916 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:16,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2019-01-11 11:01:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:16,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:16,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:16,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:17,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:17,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:17,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:17,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,167 INFO L193 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 [2019-01-11 11:01:17,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:17,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:17,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:17,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:17,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:17,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:17,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:17,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:17,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:17,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-11 11:01:17,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:17,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:01:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:01:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:01:17,901 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2019-01-11 11:01:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:17,996 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-11 11:01:17,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:01:17,996 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2019-01-11 11:01:17,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:17,997 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:01:17,998 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:01:17,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:01:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:01:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-01-11 11:01:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 11:01:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-11 11:01:18,005 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2019-01-11 11:01:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:18,005 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-11 11:01:18,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:01:18,005 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-11 11:01:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 11:01:18,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:18,006 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2019-01-11 11:01:18,006 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2019-01-11 11:01:18,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:18,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:18,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:18,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:18,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:18,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:18,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:18,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:18,412 INFO L193 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 [2019-01-11 11:01:18,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:18,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:18,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:18,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:18,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:18,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:18,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:18,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:19,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:19,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-11 11:01:19,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:19,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 11:01:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 11:01:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:19,548 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2019-01-11 11:01:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:19,789 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-11 11:01:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:01:19,790 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2019-01-11 11:01:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:19,791 INFO L225 Difference]: With dead ends: 63 [2019-01-11 11:01:19,791 INFO L226 Difference]: Without dead ends: 62 [2019-01-11 11:01:19,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-11 11:01:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-01-11 11:01:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:01:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-11 11:01:19,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2019-01-11 11:01:19,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:19,798 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-11 11:01:19,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 11:01:19,798 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-11 11:01:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 11:01:19,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:19,799 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2019-01-11 11:01:19,799 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2019-01-11 11:01:19,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:19,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:19,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:19,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:19,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:20,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:20,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:20,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:20,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,089 INFO L193 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 [2019-01-11 11:01:20,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:20,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:20,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 11:01:20,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:20,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:20,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:20,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:20,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:20,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:20,504 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:20,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:20,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:20,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-11 11:01:20,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:20,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:01:20,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:01:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:01:20,927 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2019-01-11 11:01:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:21,165 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-11 11:01:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:01:21,165 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2019-01-11 11:01:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:21,166 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:01:21,166 INFO L226 Difference]: Without dead ends: 66 [2019-01-11 11:01:21,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:01:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-11 11:01:21,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-01-11 11:01:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 11:01:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-11 11:01:21,173 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2019-01-11 11:01:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:21,174 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-11 11:01:21,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:01:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-11 11:01:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-11 11:01:21,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:21,175 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2019-01-11 11:01:21,175 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:21,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:21,176 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2019-01-11 11:01:21,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:21,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:21,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:21,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:21,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:21,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:21,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:21,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:21,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:21,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:21,604 INFO L193 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 [2019-01-11 11:01:21,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:21,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:21,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:21,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:21,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:21,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:21,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:21,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:21,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:21,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:22,332 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:22,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:22,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-11 11:01:22,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:22,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:01:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:01:22,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:22,352 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2019-01-11 11:01:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:22,496 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-11 11:01:22,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 11:01:22,496 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2019-01-11 11:01:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:22,497 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:01:22,497 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 11:01:22,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:22,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 11:01:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-01-11 11:01:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 11:01:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-11 11:01:22,504 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2019-01-11 11:01:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:22,504 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-11 11:01:22,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:01:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-11 11:01:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 11:01:22,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:22,505 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2019-01-11 11:01:22,505 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:22,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:22,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2019-01-11 11:01:22,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:22,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:22,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:23,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:23,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:23,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:23,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:23,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:23,196 INFO L193 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 [2019-01-11 11:01:23,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:23,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:23,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:23,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:23,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:23,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:23,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:24,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:25,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:25,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-11 11:01:25,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:25,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 11:01:25,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 11:01:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:01:25,476 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2019-01-11 11:01:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:25,581 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-11 11:01:25,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:01:25,582 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2019-01-11 11:01:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:25,583 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:01:25,583 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 11:01:25,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:01:25,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 11:01:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-01-11 11:01:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:01:25,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-11 11:01:25,589 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2019-01-11 11:01:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:25,590 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-11 11:01:25,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 11:01:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-11 11:01:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 11:01:25,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:25,591 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2019-01-11 11:01:25,591 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:25,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2019-01-11 11:01:25,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:25,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:25,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:25,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:25,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:25,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:25,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:25,894 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:25,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:25,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:25,894 INFO L193 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 [2019-01-11 11:01:25,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:25,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:25,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 11:01:25,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:25,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:25,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:25,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:25,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:25,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:26,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:26,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:26,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-11 11:01:26,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:26,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:01:26,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:01:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:01:26,708 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2019-01-11 11:01:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:26,859 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-11 11:01:26,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:01:26,860 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2019-01-11 11:01:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:26,861 INFO L225 Difference]: With dead ends: 79 [2019-01-11 11:01:26,861 INFO L226 Difference]: Without dead ends: 78 [2019-01-11 11:01:26,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:01:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-11 11:01:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-11 11:01:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:01:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-11 11:01:26,867 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2019-01-11 11:01:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:26,867 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-11 11:01:26,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:01:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-11 11:01:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 11:01:26,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:26,869 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2019-01-11 11:01:26,869 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:26,869 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2019-01-11 11:01:26,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:26,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:27,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:27,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:27,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:27,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:27,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:27,207 INFO L193 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 [2019-01-11 11:01:27,215 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:27,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:27,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:27,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:27,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:27,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:27,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:27,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:27,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:27,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:28,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:28,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-11 11:01:28,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:28,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:01:28,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:01:28,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:01:28,404 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2019-01-11 11:01:28,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:28,576 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-11 11:01:28,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:01:28,577 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2019-01-11 11:01:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:28,578 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:01:28,578 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:01:28,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:01:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:01:28,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-01-11 11:01:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:01:28,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-11 11:01:28,583 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2019-01-11 11:01:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:28,583 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-11 11:01:28,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:01:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-11 11:01:28,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 11:01:28,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:28,585 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2019-01-11 11:01:28,585 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:28,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:28,585 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2019-01-11 11:01:28,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:28,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:28,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:28,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:28,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:28,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:28,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:28,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:28,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:28,948 INFO L193 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 [2019-01-11 11:01:28,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:28,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:28,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:28,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:28,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:29,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:29,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:29,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:30,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-11 11:01:30,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:30,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 11:01:30,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 11:01:30,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:30,020 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2019-01-11 11:01:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:30,153 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-11 11:01:30,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 11:01:30,154 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2019-01-11 11:01:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:30,155 INFO L225 Difference]: With dead ends: 87 [2019-01-11 11:01:30,155 INFO L226 Difference]: Without dead ends: 86 [2019-01-11 11:01:30,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:30,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-11 11:01:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-01-11 11:01:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 11:01:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-11 11:01:30,161 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2019-01-11 11:01:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:30,161 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-11 11:01:30,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 11:01:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-11 11:01:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 11:01:30,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:30,162 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2019-01-11 11:01:30,163 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:30,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:30,163 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2019-01-11 11:01:30,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:30,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:30,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:30,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:30,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:30,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:30,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:30,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,490 INFO L193 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 [2019-01-11 11:01:30,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:30,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:30,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-11 11:01:30,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:30,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:30,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:30,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:30,943 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:30,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:31,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:31,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-11 11:01:31,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:31,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:01:31,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:01:31,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:01:31,563 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2019-01-11 11:01:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:31,722 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-11 11:01:31,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:01:31,722 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2019-01-11 11:01:31,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:31,724 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:01:31,724 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 11:01:31,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:01:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 11:01:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-01-11 11:01:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-11 11:01:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-11 11:01:31,729 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2019-01-11 11:01:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:31,729 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-11 11:01:31,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:01:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-11 11:01:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 11:01:31,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:31,730 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2019-01-11 11:01:31,730 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2019-01-11 11:01:31,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:31,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:31,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:31,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:32,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:32,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:32,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:32,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:32,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:32,133 INFO L193 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 [2019-01-11 11:01:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:32,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:32,168 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:32,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:32,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:32,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:32,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:32,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:32,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:32,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:33,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:33,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-11 11:01:33,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:33,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:01:33,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:01:33,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:01:33,772 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2019-01-11 11:01:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:33,940 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-11 11:01:33,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 11:01:33,944 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2019-01-11 11:01:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:33,945 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:01:33,945 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 11:01:33,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:01:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 11:01:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-01-11 11:01:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 11:01:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-11 11:01:33,949 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2019-01-11 11:01:33,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:33,950 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-11 11:01:33,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:01:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-11 11:01:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-11 11:01:33,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:33,950 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2019-01-11 11:01:33,950 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:33,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2019-01-11 11:01:33,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:33,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:33,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:34,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:34,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:34,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:34,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:34,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:34,306 INFO L193 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 [2019-01-11 11:01:34,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:34,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:34,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:34,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:34,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:34,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:34,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:34,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:35,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-11 11:01:35,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:35,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 11:01:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 11:01:35,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:01:35,541 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2019-01-11 11:01:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:35,690 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-11 11:01:35,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:01:35,695 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2019-01-11 11:01:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:35,696 INFO L225 Difference]: With dead ends: 99 [2019-01-11 11:01:35,696 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 11:01:35,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:01:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 11:01:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-01-11 11:01:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 11:01:35,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-11 11:01:35,700 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2019-01-11 11:01:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:35,700 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-11 11:01:35,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 11:01:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-11 11:01:35,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 11:01:35,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:35,701 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2019-01-11 11:01:35,701 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:35,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2019-01-11 11:01:35,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:35,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:35,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:35,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:35,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:36,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:36,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:36,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:36,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:36,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:36,256 INFO L193 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 [2019-01-11 11:01:36,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:36,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:36,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 11:01:36,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:36,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:36,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:36,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:36,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:36,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:36,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:36,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:37,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:37,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-11 11:01:37,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:37,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:01:37,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:01:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:01:37,738 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2019-01-11 11:01:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:38,020 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-11 11:01:38,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:01:38,024 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2019-01-11 11:01:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:38,025 INFO L225 Difference]: With dead ends: 103 [2019-01-11 11:01:38,025 INFO L226 Difference]: Without dead ends: 102 [2019-01-11 11:01:38,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:01:38,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-11 11:01:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-01-11 11:01:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:01:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-11 11:01:38,032 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2019-01-11 11:01:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:38,032 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-11 11:01:38,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:01:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-11 11:01:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:01:38,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:38,033 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2019-01-11 11:01:38,033 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:38,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2019-01-11 11:01:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:38,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:38,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:38,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:38,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:38,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:38,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:38,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:38,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:38,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:38,468 INFO L193 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 [2019-01-11 11:01:38,475 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:38,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:38,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:38,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:38,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:38,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:38,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:38,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:38,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:38,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:39,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:39,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-11 11:01:39,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:39,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:01:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:01:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:01:39,889 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2019-01-11 11:01:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:40,094 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-11 11:01:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:01:40,095 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2019-01-11 11:01:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:40,095 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:01:40,096 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 11:01:40,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:01:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 11:01:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-01-11 11:01:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:01:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-11 11:01:40,100 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2019-01-11 11:01:40,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:40,101 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-11 11:01:40,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:01:40,101 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-11 11:01:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 11:01:40,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:40,102 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2019-01-11 11:01:40,102 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:40,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2019-01-11 11:01:40,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:40,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:40,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:40,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:40,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:40,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:40,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:40,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:40,837 INFO L193 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 [2019-01-11 11:01:40,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:40,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:40,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:40,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:40,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:40,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:40,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:41,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:42,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:42,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-11 11:01:42,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:42,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 11:01:42,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 11:01:42,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:01:42,286 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2019-01-11 11:01:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:42,487 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-11 11:01:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 11:01:42,488 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2019-01-11 11:01:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:42,489 INFO L225 Difference]: With dead ends: 111 [2019-01-11 11:01:42,489 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 11:01:42,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:01:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 11:01:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-01-11 11:01:42,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 11:01:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-11 11:01:42,492 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2019-01-11 11:01:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:42,493 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-11 11:01:42,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 11:01:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-11 11:01:42,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-11 11:01:42,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:42,493 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2019-01-11 11:01:42,494 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2019-01-11 11:01:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:42,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:42,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:42,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:42,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:43,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:43,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:43,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:43,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:43,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:43,028 INFO L193 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 [2019-01-11 11:01:43,037 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:43,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:43,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 11:01:43,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:43,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:43,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:43,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:43,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:43,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:43,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:44,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:44,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-11 11:01:44,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:44,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 11:01:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 11:01:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 11:01:44,704 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2019-01-11 11:01:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:44,892 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-11 11:01:44,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:01:44,893 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2019-01-11 11:01:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:44,894 INFO L225 Difference]: With dead ends: 115 [2019-01-11 11:01:44,894 INFO L226 Difference]: Without dead ends: 114 [2019-01-11 11:01:44,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 11:01:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-11 11:01:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-01-11 11:01:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-11 11:01:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-11 11:01:44,899 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2019-01-11 11:01:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:44,900 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-11 11:01:44,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 11:01:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-11 11:01:44,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-11 11:01:44,900 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:44,901 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2019-01-11 11:01:44,901 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:44,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2019-01-11 11:01:44,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:44,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:44,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:44,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:45,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:45,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:45,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:45,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:45,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:45,490 INFO L193 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 [2019-01-11 11:01:45,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:45,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:45,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:45,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:45,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:45,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:45,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:45,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:45,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:46,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:46,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:47,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-11 11:01:47,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:47,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:01:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:01:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:01:47,247 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2019-01-11 11:01:47,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:47,436 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-01-11 11:01:47,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 11:01:47,436 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2019-01-11 11:01:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:47,437 INFO L225 Difference]: With dead ends: 119 [2019-01-11 11:01:47,438 INFO L226 Difference]: Without dead ends: 118 [2019-01-11 11:01:47,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:01:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-11 11:01:47,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-01-11 11:01:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 11:01:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-11 11:01:47,443 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2019-01-11 11:01:47,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:47,443 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-11 11:01:47,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:01:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-11 11:01:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-11 11:01:47,443 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:47,444 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2019-01-11 11:01:47,444 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2019-01-11 11:01:47,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:47,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:47,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:47,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:48,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:48,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:48,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:48,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:48,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:48,034 INFO L193 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 [2019-01-11 11:01:48,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:48,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:48,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:48,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:48,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:48,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:48,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:48,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:50,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-11 11:01:50,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:50,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 11:01:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 11:01:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:01:50,025 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2019-01-11 11:01:50,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:50,247 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-01-11 11:01:50,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:01:50,247 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2019-01-11 11:01:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:50,249 INFO L225 Difference]: With dead ends: 123 [2019-01-11 11:01:50,249 INFO L226 Difference]: Without dead ends: 122 [2019-01-11 11:01:50,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:01:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-11 11:01:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-01-11 11:01:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 11:01:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-11 11:01:50,254 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2019-01-11 11:01:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:50,255 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-11 11:01:50,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 11:01:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-11 11:01:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 11:01:50,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:50,256 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2019-01-11 11:01:50,256 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:50,256 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2019-01-11 11:01:50,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:50,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:50,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:50,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:50,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:50,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:50,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:50,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:50,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:50,798 INFO L193 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 [2019-01-11 11:01:50,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:50,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:50,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-11 11:01:50,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:50,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:50,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:50,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:50,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:50,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:51,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:52,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:52,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-11 11:01:52,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:52,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 11:01:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 11:01:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:01:52,708 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2019-01-11 11:01:52,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:52,894 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2019-01-11 11:01:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:01:52,895 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2019-01-11 11:01:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:52,896 INFO L225 Difference]: With dead ends: 127 [2019-01-11 11:01:52,896 INFO L226 Difference]: Without dead ends: 126 [2019-01-11 11:01:52,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:01:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-11 11:01:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-01-11 11:01:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-11 11:01:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-01-11 11:01:52,901 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2019-01-11 11:01:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:52,901 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-01-11 11:01:52,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 11:01:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-01-11 11:01:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-11 11:01:52,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:52,902 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2019-01-11 11:01:52,902 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:52,903 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2019-01-11 11:01:52,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:52,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:52,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:53,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:53,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:53,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:53,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:53,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:53,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:53,875 INFO L193 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 [2019-01-11 11:01:53,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:53,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:53,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:53,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:53,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:53,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:53,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:54,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:54,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:55,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:55,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-11 11:01:55,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:55,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:01:55,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:01:55,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:01:55,848 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2019-01-11 11:01:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:56,090 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-11 11:01:56,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:01:56,091 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2019-01-11 11:01:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:56,092 INFO L225 Difference]: With dead ends: 131 [2019-01-11 11:01:56,092 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 11:01:56,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:01:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 11:01:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-01-11 11:01:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-11 11:01:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-01-11 11:01:56,097 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2019-01-11 11:01:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:56,097 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-01-11 11:01:56,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:01:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-01-11 11:01:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-11 11:01:56,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:56,098 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2019-01-11 11:01:56,099 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2019-01-11 11:01:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:56,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:56,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:56,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:56,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:56,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:56,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,780 INFO L193 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 [2019-01-11 11:01:56,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:56,788 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:56,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:56,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:56,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:56,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:56,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:57,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:59,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:59,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-11 11:01:59,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:59,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 11:01:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 11:01:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:01:59,194 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2019-01-11 11:01:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:59,416 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-11 11:01:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 11:01:59,417 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2019-01-11 11:01:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:59,418 INFO L225 Difference]: With dead ends: 135 [2019-01-11 11:01:59,419 INFO L226 Difference]: Without dead ends: 134 [2019-01-11 11:01:59,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:01:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-11 11:01:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-01-11 11:01:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 11:01:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-01-11 11:01:59,425 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2019-01-11 11:01:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:59,425 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-01-11 11:01:59,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 11:01:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-01-11 11:01:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-11 11:01:59,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:59,426 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2019-01-11 11:01:59,427 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:59,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2019-01-11 11:01:59,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:59,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:59,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:59,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:59,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:00,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:00,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:00,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:00,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:00,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:00,629 INFO L193 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 [2019-01-11 11:02:00,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:00,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:00,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-11 11:02:00,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:00,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:00,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:00,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:00,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:00,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:01,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:03,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:03,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-11 11:02:03,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:03,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 11:02:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 11:02:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:02:03,345 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2019-01-11 11:02:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:03,614 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2019-01-11 11:02:03,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:02:03,615 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2019-01-11 11:02:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:03,616 INFO L225 Difference]: With dead ends: 139 [2019-01-11 11:02:03,616 INFO L226 Difference]: Without dead ends: 138 [2019-01-11 11:02:03,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:02:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-11 11:02:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2019-01-11 11:02:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 11:02:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-11 11:02:03,622 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2019-01-11 11:02:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:03,623 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-11 11:02:03,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 11:02:03,623 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-11 11:02:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-11 11:02:03,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:03,624 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2019-01-11 11:02:03,624 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2019-01-11 11:02:03,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:03,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:03,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:04,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:04,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:04,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:04,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:04,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:04,338 INFO L193 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 [2019-01-11 11:02:04,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:04,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:04,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:04,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:04,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:04,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:04,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:04,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:04,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:06,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:06,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:07,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:07,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-11 11:02:07,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:07,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:02:07,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:02:07,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:02:07,769 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2019-01-11 11:02:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:08,067 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2019-01-11 11:02:08,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 11:02:08,068 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2019-01-11 11:02:08,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:08,069 INFO L225 Difference]: With dead ends: 143 [2019-01-11 11:02:08,069 INFO L226 Difference]: Without dead ends: 142 [2019-01-11 11:02:08,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:02:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-11 11:02:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2019-01-11 11:02:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-11 11:02:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-11 11:02:08,075 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2019-01-11 11:02:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:08,075 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-11 11:02:08,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:02:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-11 11:02:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-11 11:02:08,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:08,076 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2019-01-11 11:02:08,077 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:08,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:08,077 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2019-01-11 11:02:08,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:08,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:08,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:08,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:08,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:08,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:08,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:08,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:08,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:08,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:08,986 INFO L193 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 [2019-01-11 11:02:08,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:08,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:09,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:09,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:09,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:09,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:09,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:10,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:11,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:11,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:11,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-11 11:02:11,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:11,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 11:02:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 11:02:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:02:11,623 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2019-01-11 11:02:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:12,042 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-01-11 11:02:12,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:02:12,042 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2019-01-11 11:02:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:12,044 INFO L225 Difference]: With dead ends: 147 [2019-01-11 11:02:12,044 INFO L226 Difference]: Without dead ends: 146 [2019-01-11 11:02:12,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:02:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-11 11:02:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-01-11 11:02:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-11 11:02:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-01-11 11:02:12,050 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2019-01-11 11:02:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:12,050 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-01-11 11:02:12,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 11:02:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-01-11 11:02:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-11 11:02:12,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:12,052 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2019-01-11 11:02:12,052 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2019-01-11 11:02:12,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:12,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:12,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:12,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:13,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:13,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:13,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:13,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:13,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:13,142 INFO L193 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 [2019-01-11 11:02:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:13,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:13,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-11 11:02:13,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:13,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:13,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:13,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:13,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:13,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:14,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:15,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:15,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-11 11:02:15,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:15,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:02:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:02:15,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:15,917 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2019-01-11 11:02:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:16,348 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-11 11:02:16,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:02:16,349 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2019-01-11 11:02:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:16,352 INFO L225 Difference]: With dead ends: 151 [2019-01-11 11:02:16,352 INFO L226 Difference]: Without dead ends: 150 [2019-01-11 11:02:16,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-11 11:02:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2019-01-11 11:02:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-11 11:02:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2019-01-11 11:02:16,358 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2019-01-11 11:02:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:16,359 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2019-01-11 11:02:16,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:02:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2019-01-11 11:02:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-11 11:02:16,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:16,360 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2019-01-11 11:02:16,360 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:16,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2019-01-11 11:02:16,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:16,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:16,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:16,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:16,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:17,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:17,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:17,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:17,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:17,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:17,218 INFO L193 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 [2019-01-11 11:02:17,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:17,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:17,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:17,293 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:17,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:17,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:17,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:17,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:17,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:18,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:20,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-11 11:02:20,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:20,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:02:20,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:02:20,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:02:20,587 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2019-01-11 11:02:20,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:20,889 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-11 11:02:20,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:02:20,890 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2019-01-11 11:02:20,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:20,891 INFO L225 Difference]: With dead ends: 155 [2019-01-11 11:02:20,892 INFO L226 Difference]: Without dead ends: 154 [2019-01-11 11:02:20,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:02:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-11 11:02:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-01-11 11:02:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-11 11:02:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2019-01-11 11:02:20,898 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2019-01-11 11:02:20,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:20,899 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2019-01-11 11:02:20,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:02:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2019-01-11 11:02:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-11 11:02:20,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:20,900 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2019-01-11 11:02:20,900 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:20,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:20,900 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2019-01-11 11:02:20,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:20,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:20,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:20,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:20,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:22,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:22,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:22,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:22,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:22,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:22,091 INFO L193 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 [2019-01-11 11:02:22,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:22,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:22,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:22,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:22,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:22,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:22,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:23,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:25,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:25,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-11 11:02:25,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:25,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 11:02:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 11:02:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:02:25,167 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2019-01-11 11:02:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:25,449 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-01-11 11:02:25,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 11:02:25,450 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2019-01-11 11:02:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:25,451 INFO L225 Difference]: With dead ends: 159 [2019-01-11 11:02:25,451 INFO L226 Difference]: Without dead ends: 158 [2019-01-11 11:02:25,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:02:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-11 11:02:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-01-11 11:02:25,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-11 11:02:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-11 11:02:25,457 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2019-01-11 11:02:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:25,457 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-11 11:02:25,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 11:02:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-11 11:02:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-11 11:02:25,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:25,458 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2019-01-11 11:02:25,458 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2019-01-11 11:02:25,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:25,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:25,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:25,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:26,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:26,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:26,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:26,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:26,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:26,751 INFO L193 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 [2019-01-11 11:02:26,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:26,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:26,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-11 11:02:26,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:26,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:26,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:26,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:26,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:26,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:27,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:27,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:29,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:29,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-11 11:02:29,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:29,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:02:29,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:02:29,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:02:29,944 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2019-01-11 11:02:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:30,225 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2019-01-11 11:02:30,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:02:30,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2019-01-11 11:02:30,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:30,227 INFO L225 Difference]: With dead ends: 163 [2019-01-11 11:02:30,227 INFO L226 Difference]: Without dead ends: 162 [2019-01-11 11:02:30,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:02:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-11 11:02:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2019-01-11 11:02:30,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 11:02:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-11 11:02:30,234 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2019-01-11 11:02:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:30,234 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-11 11:02:30,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:02:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-11 11:02:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-11 11:02:30,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:30,235 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2019-01-11 11:02:30,235 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2019-01-11 11:02:30,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:30,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:31,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:31,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:31,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:31,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:31,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:31,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:31,535 INFO L193 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 [2019-01-11 11:02:31,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:31,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:31,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:31,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:31,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:31,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:31,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:31,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:31,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:32,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:34,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:34,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:34,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-11 11:02:34,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:34,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:02:34,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:02:34,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:02:34,974 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2019-01-11 11:02:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:35,404 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2019-01-11 11:02:35,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 11:02:35,405 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2019-01-11 11:02:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:35,406 INFO L225 Difference]: With dead ends: 167 [2019-01-11 11:02:35,406 INFO L226 Difference]: Without dead ends: 166 [2019-01-11 11:02:35,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:02:35,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-11 11:02:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-01-11 11:02:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 11:02:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2019-01-11 11:02:35,413 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2019-01-11 11:02:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:35,413 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2019-01-11 11:02:35,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:02:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2019-01-11 11:02:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-11 11:02:35,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:35,414 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2019-01-11 11:02:35,414 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:35,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:35,415 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2019-01-11 11:02:35,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:35,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:35,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:35,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:35,416 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:36,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:36,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:36,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:36,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:36,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:36,535 INFO L193 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 [2019-01-11 11:02:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:36,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:36,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:36,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:36,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:36,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:36,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:37,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:40,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:40,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-11 11:02:40,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:40,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 11:02:40,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 11:02:40,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 11:02:40,091 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2019-01-11 11:02:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:40,358 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-11 11:02:40,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:02:40,358 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2019-01-11 11:02:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:40,360 INFO L225 Difference]: With dead ends: 171 [2019-01-11 11:02:40,360 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 11:02:40,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 11:02:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 11:02:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-01-11 11:02:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-11 11:02:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-01-11 11:02:40,366 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2019-01-11 11:02:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:40,366 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-01-11 11:02:40,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 11:02:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-01-11 11:02:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-11 11:02:40,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:40,367 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2019-01-11 11:02:40,367 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2019-01-11 11:02:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:40,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:40,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:41,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:41,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:41,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:41,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:41,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:41,312 INFO L193 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 [2019-01-11 11:02:41,323 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:41,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:41,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-11 11:02:41,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:41,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:41,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:41,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:41,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:41,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:42,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:45,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:45,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-11 11:02:45,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:45,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:02:45,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:02:45,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:02:45,508 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2019-01-11 11:02:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:45,786 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-11 11:02:45,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:02:45,787 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2019-01-11 11:02:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:45,788 INFO L225 Difference]: With dead ends: 175 [2019-01-11 11:02:45,789 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 11:02:45,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:02:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 11:02:45,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-01-11 11:02:45,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-11 11:02:45,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2019-01-11 11:02:45,794 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2019-01-11 11:02:45,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:45,795 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2019-01-11 11:02:45,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:02:45,795 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2019-01-11 11:02:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-11 11:02:45,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:45,796 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2019-01-11 11:02:45,796 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2019-01-11 11:02:45,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:45,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:45,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:45,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:46,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:46,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:46,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:46,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:46,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:46,884 INFO L193 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 [2019-01-11 11:02:46,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:46,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:46,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:46,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:46,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:46,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:46,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:46,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:46,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:48,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-11 11:02:50,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:50,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:02:50,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:02:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 11:02:50,716 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2019-01-11 11:02:51,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:51,283 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2019-01-11 11:02:51,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:02:51,283 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2019-01-11 11:02:51,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:51,285 INFO L225 Difference]: With dead ends: 179 [2019-01-11 11:02:51,285 INFO L226 Difference]: Without dead ends: 178 [2019-01-11 11:02:51,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 11:02:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-11 11:02:51,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-01-11 11:02:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-11 11:02:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-11 11:02:51,292 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2019-01-11 11:02:51,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:51,292 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-11 11:02:51,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:02:51,292 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-11 11:02:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-11 11:02:51,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:51,293 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2019-01-11 11:02:51,293 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:51,294 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2019-01-11 11:02:51,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:51,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:51,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:52,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:52,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:52,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:52,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:52,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:52,336 INFO L193 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 [2019-01-11 11:02:52,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:52,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:52,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:52,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:52,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:52,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:52,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:53,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:56,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:56,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-11 11:02:56,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:56,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 11:02:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 11:02:56,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:02:56,302 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2019-01-11 11:02:56,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:56,594 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-01-11 11:02:56,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 11:02:56,594 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2019-01-11 11:02:56,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:56,596 INFO L225 Difference]: With dead ends: 183 [2019-01-11 11:02:56,596 INFO L226 Difference]: Without dead ends: 182 [2019-01-11 11:02:56,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:02:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-11 11:02:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-01-11 11:02:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 11:02:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-11 11:02:56,601 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2019-01-11 11:02:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:56,601 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-11 11:02:56,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 11:02:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-11 11:02:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-11 11:02:56,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:56,602 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2019-01-11 11:02:56,602 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2019-01-11 11:02:56,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:56,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:56,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:56,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:57,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:57,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:57,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:57,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:57,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:57,800 INFO L193 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 [2019-01-11 11:02:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:57,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:57,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-11 11:02:57,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:57,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:57,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:57,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:57,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:57,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:59,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:01,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-11 11:03:01,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:01,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:03:01,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:03:01,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-11 11:03:01,995 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2019-01-11 11:03:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:02,338 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2019-01-11 11:03:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:03:02,338 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2019-01-11 11:03:02,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:02,340 INFO L225 Difference]: With dead ends: 187 [2019-01-11 11:03:02,340 INFO L226 Difference]: Without dead ends: 186 [2019-01-11 11:03:02,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-01-11 11:03:02,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-11 11:03:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2019-01-11 11:03:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 11:03:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2019-01-11 11:03:02,345 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2019-01-11 11:03:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:02,345 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2019-01-11 11:03:02,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:03:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2019-01-11 11:03:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 11:03:02,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:02,346 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2019-01-11 11:03:02,346 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:02,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:02,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2019-01-11 11:03:02,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:02,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:02,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:02,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:02,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:03,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:03,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:03,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:03,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:03,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:03,421 INFO L193 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 [2019-01-11 11:03:03,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:03,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:03,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:03,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:03,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:03,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:03,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:03,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:03,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:04,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:07,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:07,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-11 11:03:07,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:07,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:03:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:03:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:03:07,792 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2019-01-11 11:03:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:08,116 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-11 11:03:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 11:03:08,117 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2019-01-11 11:03:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:08,118 INFO L225 Difference]: With dead ends: 191 [2019-01-11 11:03:08,118 INFO L226 Difference]: Without dead ends: 190 [2019-01-11 11:03:08,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:03:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-11 11:03:08,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-01-11 11:03:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-11 11:03:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2019-01-11 11:03:08,122 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2019-01-11 11:03:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:08,122 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2019-01-11 11:03:08,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:03:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2019-01-11 11:03:08,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-11 11:03:08,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:08,123 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2019-01-11 11:03:08,123 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:08,123 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2019-01-11 11:03:08,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:08,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:08,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:08,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:09,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:09,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:09,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:09,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:09,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:09,891 INFO L193 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 [2019-01-11 11:03:09,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:09,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:09,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:09,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:09,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:09,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:09,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:12,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:15,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:15,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-11 11:03:15,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:15,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 11:03:15,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 11:03:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-11 11:03:15,124 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2019-01-11 11:03:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:15,538 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-11 11:03:15,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:03:15,539 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2019-01-11 11:03:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:15,540 INFO L225 Difference]: With dead ends: 195 [2019-01-11 11:03:15,540 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 11:03:15,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-01-11 11:03:15,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 11:03:15,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-01-11 11:03:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-11 11:03:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-01-11 11:03:15,547 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2019-01-11 11:03:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:15,548 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-01-11 11:03:15,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 11:03:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-01-11 11:03:15,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-11 11:03:15,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:15,549 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2019-01-11 11:03:15,549 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2019-01-11 11:03:15,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:15,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:15,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:15,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:15,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:17,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:17,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:17,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:17,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:17,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:17,450 INFO L193 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 [2019-01-11 11:03:17,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:17,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:17,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-11 11:03:17,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:17,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:17,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:17,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:19,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:22,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:22,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:22,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-11 11:03:22,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:22,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 11:03:22,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 11:03:22,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:03:22,200 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2019-01-11 11:03:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:22,557 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2019-01-11 11:03:22,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:03:22,558 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2019-01-11 11:03:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:22,559 INFO L225 Difference]: With dead ends: 199 [2019-01-11 11:03:22,559 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 11:03:22,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:03:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 11:03:22,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2019-01-11 11:03:22,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-11 11:03:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-11 11:03:22,566 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2019-01-11 11:03:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:22,566 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-11 11:03:22,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 11:03:22,566 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-11 11:03:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-11 11:03:22,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:22,567 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2019-01-11 11:03:22,568 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:22,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:22,568 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2019-01-11 11:03:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:22,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:22,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:22,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:22,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:24,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:24,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:24,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:24,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:24,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:24,013 INFO L193 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 [2019-01-11 11:03:24,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:24,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:24,080 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:24,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:24,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:24,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:24,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:24,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:24,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:25,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:28,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:28,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-11 11:03:28,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:28,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:03:28,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:03:28,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-11 11:03:28,778 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2019-01-11 11:03:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:29,142 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2019-01-11 11:03:29,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:03:29,142 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2019-01-11 11:03:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:29,143 INFO L225 Difference]: With dead ends: 203 [2019-01-11 11:03:29,144 INFO L226 Difference]: Without dead ends: 202 [2019-01-11 11:03:29,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-01-11 11:03:29,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-01-11 11:03:29,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-01-11 11:03:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-11 11:03:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-11 11:03:29,150 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2019-01-11 11:03:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:29,150 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-11 11:03:29,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:03:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-11 11:03:29,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-11 11:03:29,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:29,151 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2019-01-11 11:03:29,151 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2019-01-11 11:03:29,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:29,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:29,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:29,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:29,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:30,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:30,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:30,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:30,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:30,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:30,601 INFO L193 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 [2019-01-11 11:03:30,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:30,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:30,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:30,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:30,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:30,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:30,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:32,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:35,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:35,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-11 11:03:35,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:35,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 11:03:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 11:03:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:03:35,327 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2019-01-11 11:03:35,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:35,698 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-01-11 11:03:35,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 11:03:35,699 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2019-01-11 11:03:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:35,700 INFO L225 Difference]: With dead ends: 207 [2019-01-11 11:03:35,700 INFO L226 Difference]: Without dead ends: 206 [2019-01-11 11:03:35,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:03:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-01-11 11:03:35,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-01-11 11:03:35,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-11 11:03:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-01-11 11:03:35,707 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2019-01-11 11:03:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:35,707 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-01-11 11:03:35,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 11:03:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-01-11 11:03:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-11 11:03:35,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:35,708 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2019-01-11 11:03:35,708 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:35,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2019-01-11 11:03:35,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:35,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:35,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:35,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:35,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:37,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:37,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:37,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:37,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:37,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:37,100 INFO L193 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 [2019-01-11 11:03:37,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:37,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:37,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-11 11:03:37,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:37,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:37,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:37,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:37,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:37,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:38,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:42,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:42,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-11 11:03:42,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:42,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 11:03:42,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 11:03:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-11 11:03:42,209 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2019-01-11 11:03:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:42,619 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-11 11:03:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:03:42,619 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2019-01-11 11:03:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:42,621 INFO L225 Difference]: With dead ends: 211 [2019-01-11 11:03:42,621 INFO L226 Difference]: Without dead ends: 210 [2019-01-11 11:03:42,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 304 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-01-11 11:03:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-11 11:03:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2019-01-11 11:03:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-11 11:03:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2019-01-11 11:03:42,626 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2019-01-11 11:03:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:42,627 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2019-01-11 11:03:42,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 11:03:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2019-01-11 11:03:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-11 11:03:42,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:42,628 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2019-01-11 11:03:42,628 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:42,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:42,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2019-01-11 11:03:42,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:42,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:42,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:42,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:42,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:44,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:44,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:44,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:44,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:44,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:44,014 INFO L193 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 [2019-01-11 11:03:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:44,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:44,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:44,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:44,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:44,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:44,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:44,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:44,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:46,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:49,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:49,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-01-11 11:03:49,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:49,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:03:49,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:03:49,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:03:49,440 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2019-01-11 11:03:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:49,868 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-11 11:03:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 11:03:49,869 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2019-01-11 11:03:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:49,870 INFO L225 Difference]: With dead ends: 215 [2019-01-11 11:03:49,870 INFO L226 Difference]: Without dead ends: 214 [2019-01-11 11:03:49,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:03:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-11 11:03:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2019-01-11 11:03:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-11 11:03:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2019-01-11 11:03:49,877 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2019-01-11 11:03:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:49,878 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2019-01-11 11:03:49,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:03:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2019-01-11 11:03:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-11 11:03:49,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:49,879 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2019-01-11 11:03:49,879 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:49,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:49,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2019-01-11 11:03:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:49,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:49,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:49,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:51,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:51,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:51,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:51,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:51,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:51,535 INFO L193 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 [2019-01-11 11:03:51,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:51,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:51,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:51,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:51,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:51,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:51,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:53,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:56,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:56,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:56,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-01-11 11:03:56,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:56,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-11 11:03:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-11 11:03:56,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 11:03:56,651 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2019-01-11 11:03:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:57,018 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-01-11 11:03:57,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:03:57,018 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2019-01-11 11:03:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:57,020 INFO L225 Difference]: With dead ends: 219 [2019-01-11 11:03:57,020 INFO L226 Difference]: Without dead ends: 218 [2019-01-11 11:03:57,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 316 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 11:03:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-01-11 11:03:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-01-11 11:03:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-11 11:03:57,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-11 11:03:57,025 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2019-01-11 11:03:57,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:57,026 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-11 11:03:57,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-11 11:03:57,026 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-11 11:03:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-11 11:03:57,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:57,027 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2019-01-11 11:03:57,027 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:57,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2019-01-11 11:03:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:57,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:57,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:57,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:58,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:58,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:58,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:58,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:58,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:58,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:58,586 INFO L193 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 [2019-01-11 11:03:58,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:58,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:58,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-11 11:03:58,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:58,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:58,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:58,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:58,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:58,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:00,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:03,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:03,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-01-11 11:04:03,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:03,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-11 11:04:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-11 11:04:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:04:03,883 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2019-01-11 11:04:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:04,267 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2019-01-11 11:04:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:04:04,268 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2019-01-11 11:04:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:04,269 INFO L225 Difference]: With dead ends: 223 [2019-01-11 11:04:04,270 INFO L226 Difference]: Without dead ends: 222 [2019-01-11 11:04:04,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 322 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:04:04,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-11 11:04:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-01-11 11:04:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:04:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-11 11:04:04,275 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2019-01-11 11:04:04,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:04,275 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-11 11:04:04,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-11 11:04:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-11 11:04:04,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-11 11:04:04,276 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:04,276 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2019-01-11 11:04:04,276 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2019-01-11 11:04:04,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:04,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:04,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,277 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:05,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:05,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:05,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:05,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:05,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:05,710 INFO L193 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 [2019-01-11 11:04:05,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:05,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:05,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:05,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:05,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:05,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:05,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:05,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:05,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:07,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:11,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:11,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-01-11 11:04:11,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:11,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 11:04:11,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 11:04:11,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-11 11:04:11,199 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2019-01-11 11:04:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:11,722 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2019-01-11 11:04:11,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:04:11,722 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2019-01-11 11:04:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:11,723 INFO L225 Difference]: With dead ends: 227 [2019-01-11 11:04:11,723 INFO L226 Difference]: Without dead ends: 226 [2019-01-11 11:04:11,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-01-11 11:04:11,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-11 11:04:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2019-01-11 11:04:11,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:04:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2019-01-11 11:04:11,730 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2019-01-11 11:04:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:11,730 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2019-01-11 11:04:11,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 11:04:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2019-01-11 11:04:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-01-11 11:04:11,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:11,732 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2019-01-11 11:04:11,732 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:11,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2019-01-11 11:04:11,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:11,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:11,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:11,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:11,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:13,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:13,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:13,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:13,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:13,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:13,360 INFO L193 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 [2019-01-11 11:04:13,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:13,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:13,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:13,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:13,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:13,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:13,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:15,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:18,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:18,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-01-11 11:04:18,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:18,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-11 11:04:18,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-11 11:04:18,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:04:18,886 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2019-01-11 11:04:19,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:19,348 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-11 11:04:19,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 11:04:19,349 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2019-01-11 11:04:19,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:19,350 INFO L225 Difference]: With dead ends: 231 [2019-01-11 11:04:19,350 INFO L226 Difference]: Without dead ends: 230 [2019-01-11 11:04:19,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 334 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:04:19,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-11 11:04:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-01-11 11:04:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-11 11:04:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-01-11 11:04:19,357 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2019-01-11 11:04:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:19,357 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-01-11 11:04:19,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-11 11:04:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-01-11 11:04:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-11 11:04:19,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:19,359 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2019-01-11 11:04:19,359 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:19,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2019-01-11 11:04:19,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:19,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:19,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:19,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:19,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:20,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:20,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:20,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:20,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:20,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:20,934 INFO L193 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 [2019-01-11 11:04:20,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:20,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:21,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-11 11:04:21,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:21,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:21,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:21,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:21,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:21,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:23,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:26,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:26,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-01-11 11:04:26,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:26,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-11 11:04:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-11 11:04:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-11 11:04:26,809 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2019-01-11 11:04:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:27,359 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-11 11:04:27,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:04:27,360 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2019-01-11 11:04:27,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:27,361 INFO L225 Difference]: With dead ends: 235 [2019-01-11 11:04:27,361 INFO L226 Difference]: Without dead ends: 234 [2019-01-11 11:04:27,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 340 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-01-11 11:04:27,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-11 11:04:27,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2019-01-11 11:04:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-01-11 11:04:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2019-01-11 11:04:27,366 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2019-01-11 11:04:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:27,366 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2019-01-11 11:04:27,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-11 11:04:27,366 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2019-01-11 11:04:27,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-01-11 11:04:27,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:27,368 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2019-01-11 11:04:27,368 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:27,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:27,368 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2019-01-11 11:04:27,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:27,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:27,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:29,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:29,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:29,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:29,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:29,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:29,981 INFO L193 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 [2019-01-11 11:04:29,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:29,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:30,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:30,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:30,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:30,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:30,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:30,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:30,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:32,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:36,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:36,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-01-11 11:04:36,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:36,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-11 11:04:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-11 11:04:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:04:36,250 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2019-01-11 11:04:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:36,733 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2019-01-11 11:04:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 11:04:36,734 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2019-01-11 11:04:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:36,735 INFO L225 Difference]: With dead ends: 239 [2019-01-11 11:04:36,735 INFO L226 Difference]: Without dead ends: 238 [2019-01-11 11:04:36,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 346 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:04:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-01-11 11:04:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2019-01-11 11:04:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-11 11:04:36,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-11 11:04:36,741 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2019-01-11 11:04:36,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:36,741 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-11 11:04:36,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-11 11:04:36,741 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-11 11:04:36,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-11 11:04:36,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:36,742 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2019-01-11 11:04:36,742 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2019-01-11 11:04:36,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:36,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:36,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:36,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:38,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:38,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:38,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:38,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:38,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:38,566 INFO L193 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 [2019-01-11 11:04:38,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:38,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:38,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:38,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:38,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:38,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:38,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:40,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:44,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:44,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:44,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-01-11 11:04:44,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:44,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-11 11:04:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-11 11:04:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:04:44,366 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2019-01-11 11:04:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:44,831 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-01-11 11:04:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:04:44,832 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2019-01-11 11:04:44,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:44,833 INFO L225 Difference]: With dead ends: 243 [2019-01-11 11:04:44,834 INFO L226 Difference]: Without dead ends: 242 [2019-01-11 11:04:44,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 352 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:04:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-01-11 11:04:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-01-11 11:04:44,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 11:04:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-11 11:04:44,839 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2019-01-11 11:04:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:44,839 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-11 11:04:44,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-11 11:04:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-11 11:04:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-11 11:04:44,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:44,840 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2019-01-11 11:04:44,841 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:44,841 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2019-01-11 11:04:44,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:44,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:44,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:44,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:44,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:46,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:46,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:46,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:46,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:46,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:46,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:46,664 INFO L193 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 [2019-01-11 11:04:46,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:46,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:46,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-11 11:04:46,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:46,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:46,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:46,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:46,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:46,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:49,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:53,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-01-11 11:04:53,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:53,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-11 11:04:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-11 11:04:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:04:53,042 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2019-01-11 11:04:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:53,503 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2019-01-11 11:04:53,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:04:53,503 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2019-01-11 11:04:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:53,504 INFO L225 Difference]: With dead ends: 247 [2019-01-11 11:04:53,504 INFO L226 Difference]: Without dead ends: 246 [2019-01-11 11:04:53,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 358 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:04:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-11 11:04:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2019-01-11 11:04:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-11 11:04:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2019-01-11 11:04:53,511 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2019-01-11 11:04:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:53,511 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2019-01-11 11:04:53,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-11 11:04:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2019-01-11 11:04:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-11 11:04:53,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:53,512 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2019-01-11 11:04:53,513 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2019-01-11 11:04:53,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:53,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:53,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:55,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:55,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:55,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:55,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:55,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:55,303 INFO L193 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 [2019-01-11 11:04:55,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:55,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:55,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:55,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:55,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:55,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:55,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:55,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:55,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:57,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:01,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:01,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-01-11 11:05:01,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:01,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-11 11:05:01,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-11 11:05:01,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-11 11:05:01,179 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2019-01-11 11:05:01,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:01,658 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-11 11:05:01,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:05:01,658 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2019-01-11 11:05:01,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:01,659 INFO L225 Difference]: With dead ends: 251 [2019-01-11 11:05:01,659 INFO L226 Difference]: Without dead ends: 250 [2019-01-11 11:05:01,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 364 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-01-11 11:05:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-11 11:05:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-01-11 11:05:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-01-11 11:05:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2019-01-11 11:05:01,666 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2019-01-11 11:05:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:01,666 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2019-01-11 11:05:01,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-11 11:05:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2019-01-11 11:05:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-01-11 11:05:01,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:01,667 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2019-01-11 11:05:01,668 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:01,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:01,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2019-01-11 11:05:01,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:01,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:01,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:01,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:01,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:03,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:03,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:03,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:03,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:03,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:03,719 INFO L193 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 [2019-01-11 11:05:03,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:03,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:03,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:03,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:03,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:03,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:03,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:06,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:09,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-01-11 11:05:09,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:09,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-11 11:05:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-11 11:05:09,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:05:09,832 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2019-01-11 11:05:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:10,272 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-11 11:05:10,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 11:05:10,273 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2019-01-11 11:05:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:10,274 INFO L225 Difference]: With dead ends: 255 [2019-01-11 11:05:10,274 INFO L226 Difference]: Without dead ends: 254 [2019-01-11 11:05:10,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 370 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:05:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-11 11:05:10,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-01-11 11:05:10,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-11 11:05:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-01-11 11:05:10,279 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2019-01-11 11:05:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:10,279 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-01-11 11:05:10,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-11 11:05:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-01-11 11:05:10,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-01-11 11:05:10,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:10,281 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2019-01-11 11:05:10,281 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2019-01-11 11:05:10,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:10,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:10,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:10,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:12,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:12,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:12,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:12,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:12,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:12,263 INFO L193 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 [2019-01-11 11:05:12,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:12,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:12,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-11 11:05:12,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:12,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:12,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:12,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:12,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:12,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:15,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:15,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:18,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:18,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-01-11 11:05:18,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:18,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-11 11:05:18,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-11 11:05:18,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 11:05:18,809 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2019-01-11 11:05:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:19,251 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-01-11 11:05:19,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:05:19,251 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2019-01-11 11:05:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:19,252 INFO L225 Difference]: With dead ends: 259 [2019-01-11 11:05:19,253 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 11:05:19,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 376 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 11:05:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 11:05:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-11 11:05:19,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-11 11:05:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-11 11:05:19,258 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2019-01-11 11:05:19,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:19,258 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-11 11:05:19,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-11 11:05:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-11 11:05:19,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-11 11:05:19,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:19,259 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2019-01-11 11:05:19,259 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:19,260 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2019-01-11 11:05:19,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:19,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:19,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:19,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:19,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:21,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:21,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:21,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:21,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:21,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:21,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:21,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:21,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:21,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:21,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:21,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:21,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:21,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:21,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:21,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:23,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:27,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-01-11 11:05:27,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:27,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-11 11:05:27,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-11 11:05:27,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:05:27,675 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2019-01-11 11:05:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:28,137 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2019-01-11 11:05:28,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 11:05:28,137 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2019-01-11 11:05:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:28,138 INFO L225 Difference]: With dead ends: 263 [2019-01-11 11:05:28,138 INFO L226 Difference]: Without dead ends: 262 [2019-01-11 11:05:28,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 382 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:05:28,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-01-11 11:05:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2019-01-11 11:05:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-11 11:05:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-11 11:05:28,145 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2019-01-11 11:05:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:28,145 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-11 11:05:28,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-11 11:05:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-11 11:05:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-11 11:05:28,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:28,147 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2019-01-11 11:05:28,147 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2019-01-11 11:05:28,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:28,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:28,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:30,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:30,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:30,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:30,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:30,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:30,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:30,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:30,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:30,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:30,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:30,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:30,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:30,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:32,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:36,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:36,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-01-11 11:05:36,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:36,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-11 11:05:36,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-11 11:05:36,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-11 11:05:36,672 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2019-01-11 11:05:37,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:37,148 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-01-11 11:05:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:05:37,149 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2019-01-11 11:05:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:37,150 INFO L225 Difference]: With dead ends: 267 [2019-01-11 11:05:37,150 INFO L226 Difference]: Without dead ends: 266 [2019-01-11 11:05:37,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 388 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-01-11 11:05:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-11 11:05:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-01-11 11:05:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-01-11 11:05:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-01-11 11:05:37,156 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2019-01-11 11:05:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:37,156 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-01-11 11:05:37,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-11 11:05:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-01-11 11:05:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-01-11 11:05:37,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:37,158 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2019-01-11 11:05:37,158 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2019-01-11 11:05:37,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:37,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:37,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:37,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:39,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:39,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:39,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:39,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:39,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:39,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:39,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:39,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:39,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-11 11:05:39,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:39,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:39,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:39,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:39,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:39,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:42,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:42,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:46,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:46,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-01-11 11:05:46,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:46,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-11 11:05:46,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-11 11:05:46,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:05:46,330 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2019-01-11 11:05:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:46,893 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-11 11:05:46,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:05:46,893 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2019-01-11 11:05:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:46,895 INFO L225 Difference]: With dead ends: 271 [2019-01-11 11:05:46,895 INFO L226 Difference]: Without dead ends: 270 [2019-01-11 11:05:46,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 394 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:05:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-11 11:05:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2019-01-11 11:05:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-11 11:05:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2019-01-11 11:05:46,900 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2019-01-11 11:05:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:46,900 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2019-01-11 11:05:46,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-11 11:05:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2019-01-11 11:05:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-11 11:05:46,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:46,902 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2019-01-11 11:05:46,902 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:46,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:46,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2019-01-11 11:05:46,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:46,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:46,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:46,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:46,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:49,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:49,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:49,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:49,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:49,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:49,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:49,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:49,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:49,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:49,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:49,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:49,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:49,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:49,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:49,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:51,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:55,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:55,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-01-11 11:05:55,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:55,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-11 11:05:55,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-11 11:05:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-11 11:05:55,909 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2019-01-11 11:05:56,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:56,404 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-11 11:05:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:05:56,405 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2019-01-11 11:05:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:56,406 INFO L225 Difference]: With dead ends: 275 [2019-01-11 11:05:56,406 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 11:05:56,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 400 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-01-11 11:05:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 11:05:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2019-01-11 11:05:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-11 11:05:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2019-01-11 11:05:56,410 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2019-01-11 11:05:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:56,411 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2019-01-11 11:05:56,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-11 11:05:56,411 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2019-01-11 11:05:56,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-11 11:05:56,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:56,412 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2019-01-11 11:05:56,412 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:56,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:56,412 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2019-01-11 11:05:56,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:56,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:56,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:56,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:58,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:58,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:58,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:58,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:58,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:58,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:58,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:58,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:58,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:58,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:58,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:58,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:58,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:01,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:05,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:05,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-01-11 11:06:05,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:05,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-11 11:06:05,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-11 11:06:05,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:06:05,494 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2019-01-11 11:06:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:06,068 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-01-11 11:06:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 11:06:06,069 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2019-01-11 11:06:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:06,070 INFO L225 Difference]: With dead ends: 279 [2019-01-11 11:06:06,070 INFO L226 Difference]: Without dead ends: 278 [2019-01-11 11:06:06,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 406 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:06:06,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-11 11:06:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-01-11 11:06:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-11 11:06:06,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-11 11:06:06,076 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2019-01-11 11:06:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:06,077 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-11 11:06:06,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-11 11:06:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-11 11:06:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-11 11:06:06,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:06,078 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2019-01-11 11:06:06,078 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2019-01-11 11:06:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:06,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:06,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:08,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:08,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:08,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:08,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:08,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:08,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:08,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:08,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-11 11:06:08,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:08,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:08,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:08,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:08,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:08,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:11,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:15,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:15,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-01-11 11:06:15,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:15,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-11 11:06:15,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-11 11:06:15,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 11:06:15,524 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2019-01-11 11:06:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:16,038 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2019-01-11 11:06:16,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:06:16,039 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2019-01-11 11:06:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:16,041 INFO L225 Difference]: With dead ends: 283 [2019-01-11 11:06:16,041 INFO L226 Difference]: Without dead ends: 282 [2019-01-11 11:06:16,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 619 GetRequests, 412 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 11:06:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-01-11 11:06:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2019-01-11 11:06:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-11 11:06:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-11 11:06:16,047 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2019-01-11 11:06:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:16,048 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-11 11:06:16,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-11 11:06:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-11 11:06:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-11 11:06:16,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:16,050 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2019-01-11 11:06:16,050 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2019-01-11 11:06:16,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:16,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:16,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:18,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:18,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:18,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:18,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:18,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:18,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:18,340 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:18,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:18,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:18,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:18,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:18,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:18,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:18,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:18,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:21,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:21,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:25,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:25,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-01-11 11:06:25,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:25,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-11 11:06:25,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-11 11:06:25,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:06:25,577 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2019-01-11 11:06:26,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:26,123 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2019-01-11 11:06:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:06:26,123 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2019-01-11 11:06:26,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:26,125 INFO L225 Difference]: With dead ends: 287 [2019-01-11 11:06:26,125 INFO L226 Difference]: Without dead ends: 286 [2019-01-11 11:06:26,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 418 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:06:26,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-11 11:06:26,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2019-01-11 11:06:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-11 11:06:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2019-01-11 11:06:26,130 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2019-01-11 11:06:26,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:26,131 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2019-01-11 11:06:26,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-11 11:06:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2019-01-11 11:06:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-01-11 11:06:26,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:26,132 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2019-01-11 11:06:26,132 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2019-01-11 11:06:26,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:26,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:26,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:28,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:28,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:28,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:28,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:28,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:28,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:28,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:28,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:28,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:28,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:28,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:28,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:28,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:31,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:35,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:35,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:35,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-01-11 11:06:35,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:35,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-11 11:06:35,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-11 11:06:35,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-11 11:06:35,897 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2019-01-11 11:06:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:36,461 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-11 11:06:36,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:06:36,461 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2019-01-11 11:06:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:36,463 INFO L225 Difference]: With dead ends: 291 [2019-01-11 11:06:36,463 INFO L226 Difference]: Without dead ends: 290 [2019-01-11 11:06:36,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 424 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-01-11 11:06:36,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-11 11:06:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-01-11 11:06:36,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-01-11 11:06:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-01-11 11:06:36,468 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2019-01-11 11:06:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:36,469 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-01-11 11:06:36,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-11 11:06:36,469 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-01-11 11:06:36,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-01-11 11:06:36,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:36,470 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2019-01-11 11:06:36,470 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:36,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:36,470 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2019-01-11 11:06:36,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:36,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:38,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:38,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:38,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:38,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:38,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:38,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:38,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:38,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:39,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-11 11:06:39,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:39,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:39,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:39,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:39,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:39,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:42,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:46,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:46,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:46,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-01-11 11:06:46,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:46,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-11 11:06:46,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-11 11:06:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:06:46,407 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2019-01-11 11:06:46,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:46,980 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-11 11:06:46,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:06:46,980 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2019-01-11 11:06:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:46,982 INFO L225 Difference]: With dead ends: 295 [2019-01-11 11:06:46,982 INFO L226 Difference]: Without dead ends: 294 [2019-01-11 11:06:46,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 430 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:06:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-11 11:06:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2019-01-11 11:06:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-11 11:06:46,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2019-01-11 11:06:46,987 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2019-01-11 11:06:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:46,987 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2019-01-11 11:06:46,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-11 11:06:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2019-01-11 11:06:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-01-11 11:06:46,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:46,989 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2019-01-11 11:06:46,989 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:46,989 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2019-01-11 11:06:46,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:46,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:46,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:46,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:49,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:49,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:49,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:49,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:49,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:49,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:49,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:49,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:49,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:49,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:49,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:49,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:49,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:49,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:49,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:52,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:57,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:57,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-01-11 11:06:57,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:57,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-11 11:06:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-11 11:06:57,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 11:06:57,040 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2019-01-11 11:06:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:57,687 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2019-01-11 11:06:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:06:57,687 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2019-01-11 11:06:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:57,689 INFO L225 Difference]: With dead ends: 299 [2019-01-11 11:06:57,689 INFO L226 Difference]: Without dead ends: 298 [2019-01-11 11:06:57,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 436 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 11:06:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-01-11 11:06:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2019-01-11 11:06:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-11 11:06:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-11 11:06:57,695 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2019-01-11 11:06:57,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:57,695 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-11 11:06:57,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-11 11:06:57,695 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-11 11:06:57,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-11 11:06:57,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:57,696 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2019-01-11 11:06:57,696 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:57,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:57,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2019-01-11 11:06:57,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:57,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:57,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:57,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:57,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:00,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:00,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:00,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:00,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:00,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:00,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:00,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:00,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:07:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:00,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:00,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:00,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:00,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:00,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:03,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:07,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:07,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-01-11 11:07:07,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:07,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-11 11:07:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-11 11:07:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:07:07,687 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2019-01-11 11:07:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:08,205 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-01-11 11:07:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 11:07:08,206 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2019-01-11 11:07:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:08,208 INFO L225 Difference]: With dead ends: 303 [2019-01-11 11:07:08,208 INFO L226 Difference]: Without dead ends: 302 [2019-01-11 11:07:08,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 442 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:07:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-11 11:07:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-01-11 11:07:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-11 11:07:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-11 11:07:08,214 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2019-01-11 11:07:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:08,214 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-11 11:07:08,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-11 11:07:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-11 11:07:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-11 11:07:08,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:08,215 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2019-01-11 11:07:08,216 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:08,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2019-01-11 11:07:08,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:08,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:08,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:08,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:11,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:11,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:11,022 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:11,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:11,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:11,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:11,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:11,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:11,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-11 11:07:11,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:11,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:11,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:11,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:11,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:11,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:14,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:18,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:18,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-01-11 11:07:18,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:18,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-11 11:07:18,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-11 11:07:18,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-11 11:07:18,766 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2019-01-11 11:07:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:19,402 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2019-01-11 11:07:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:07:19,403 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2019-01-11 11:07:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:19,405 INFO L225 Difference]: With dead ends: 307 [2019-01-11 11:07:19,405 INFO L226 Difference]: Without dead ends: 306 [2019-01-11 11:07:19,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 448 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-01-11 11:07:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-11 11:07:19,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2019-01-11 11:07:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-01-11 11:07:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2019-01-11 11:07:19,411 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2019-01-11 11:07:19,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:19,411 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2019-01-11 11:07:19,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-11 11:07:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2019-01-11 11:07:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-01-11 11:07:19,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:19,412 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2019-01-11 11:07:19,413 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:19,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:19,413 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2019-01-11 11:07:19,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:19,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:19,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:19,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:22,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:22,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:22,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:22,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:22,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:22,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:22,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:22,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:22,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:22,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:22,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:22,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:22,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:22,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:22,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:25,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:29,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:29,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-01-11 11:07:29,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:29,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-11 11:07:29,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-11 11:07:29,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:07:29,789 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2019-01-11 11:07:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:30,403 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-11 11:07:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 11:07:30,403 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2019-01-11 11:07:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:30,405 INFO L225 Difference]: With dead ends: 311 [2019-01-11 11:07:30,406 INFO L226 Difference]: Without dead ends: 310 [2019-01-11 11:07:30,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 454 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:07:30,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-11 11:07:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2019-01-11 11:07:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-01-11 11:07:30,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2019-01-11 11:07:30,413 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2019-01-11 11:07:30,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:30,413 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2019-01-11 11:07:30,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-11 11:07:30,414 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2019-01-11 11:07:30,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-01-11 11:07:30,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:30,415 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2019-01-11 11:07:30,415 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:30,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:30,416 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2019-01-11 11:07:30,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:30,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:30,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:30,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:30,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:33,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:33,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:33,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:33,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:33,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:33,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:33,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:33,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:33,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:07:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:33,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:33,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:33,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:33,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:33,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:37,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:41,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:41,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-01-11 11:07:41,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:41,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-11 11:07:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-11 11:07:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-11 11:07:41,154 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2019-01-11 11:07:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:41,813 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-11 11:07:41,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:07:41,814 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2019-01-11 11:07:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:41,815 INFO L225 Difference]: With dead ends: 315 [2019-01-11 11:07:41,815 INFO L226 Difference]: Without dead ends: 314 [2019-01-11 11:07:41,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 460 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-01-11 11:07:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-11 11:07:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2019-01-11 11:07:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-01-11 11:07:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2019-01-11 11:07:41,822 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2019-01-11 11:07:41,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:41,822 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2019-01-11 11:07:41,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-11 11:07:41,822 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2019-01-11 11:07:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-01-11 11:07:41,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:41,823 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2019-01-11 11:07:41,823 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:41,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2019-01-11 11:07:41,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:41,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:41,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:41,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:41,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:44,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:44,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:44,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:44,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:44,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:44,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:44,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:44,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:45,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-11 11:07:45,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:45,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:45,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:45,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:45,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:45,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:48,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:52,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:52,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-01-11 11:07:52,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:52,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-11 11:07:52,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-11 11:07:52,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:07:52,916 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 158 states. [2019-01-11 11:07:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:53,552 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2019-01-11 11:07:53,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:07:53,552 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 312 [2019-01-11 11:07:53,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:53,554 INFO L225 Difference]: With dead ends: 319 [2019-01-11 11:07:53,554 INFO L226 Difference]: Without dead ends: 318 [2019-01-11 11:07:53,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 466 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:07:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-11 11:07:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2019-01-11 11:07:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-11 11:07:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-11 11:07:53,561 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 312 [2019-01-11 11:07:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:53,561 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-11 11:07:53,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-11 11:07:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-11 11:07:53,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-11 11:07:53,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:53,562 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 1, 1] [2019-01-11 11:07:53,562 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:53,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1416815940, now seen corresponding path program 78 times [2019-01-11 11:07:53,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:53,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:53,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:53,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:53,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:56,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:56,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:56,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:56,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:56,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:56,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:56,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:56,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:56,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:56,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:56,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:56,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:56,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:56,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:56,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:00,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:04,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-01-11 11:08:04,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:04,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-11 11:08:04,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-11 11:08:04,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 11:08:04,592 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 160 states. [2019-01-11 11:08:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:05,281 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2019-01-11 11:08:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 11:08:05,281 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 316 [2019-01-11 11:08:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:05,283 INFO L225 Difference]: With dead ends: 323 [2019-01-11 11:08:05,283 INFO L226 Difference]: Without dead ends: 322 [2019-01-11 11:08:05,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 472 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 11:08:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-01-11 11:08:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 321. [2019-01-11 11:08:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-11 11:08:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-11 11:08:05,289 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 316 [2019-01-11 11:08:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:05,289 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-11 11:08:05,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-11 11:08:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-11 11:08:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-11 11:08:05,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:05,291 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 1, 1] [2019-01-11 11:08:05,291 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1783280509, now seen corresponding path program 79 times [2019-01-11 11:08:05,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:05,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:05,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:08,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:08,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:08,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:08,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:08,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:08,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:08,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:08,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:08,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:08,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:08,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:08,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:08,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:12,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:16,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:16,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-01-11 11:08:16,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:16,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-11 11:08:16,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-11 11:08:16,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:08:16,300 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 162 states. [2019-01-11 11:08:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:16,974 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2019-01-11 11:08:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-11 11:08:16,974 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 320 [2019-01-11 11:08:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:16,976 INFO L225 Difference]: With dead ends: 327 [2019-01-11 11:08:16,976 INFO L226 Difference]: Without dead ends: 326 [2019-01-11 11:08:16,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 478 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:08:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-01-11 11:08:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 325. [2019-01-11 11:08:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-11 11:08:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2019-01-11 11:08:16,982 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 320 [2019-01-11 11:08:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:16,982 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2019-01-11 11:08:16,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-11 11:08:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2019-01-11 11:08:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-01-11 11:08:16,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:16,983 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 1, 1] [2019-01-11 11:08:16,983 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash 380550454, now seen corresponding path program 80 times [2019-01-11 11:08:16,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:16,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:16,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:20,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:20,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:20,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:20,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:20,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:20,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:20,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:20,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:08:20,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:08:20,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-11 11:08:20,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:20,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:20,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:20,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:20,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:20,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:24,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:29,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:29,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-01-11 11:08:29,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:29,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-11 11:08:29,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-11 11:08:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-11 11:08:29,033 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 164 states. [2019-01-11 11:08:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:29,733 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-11 11:08:29,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:08:29,734 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 324 [2019-01-11 11:08:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:29,736 INFO L225 Difference]: With dead ends: 331 [2019-01-11 11:08:29,736 INFO L226 Difference]: Without dead ends: 330 [2019-01-11 11:08:29,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 484 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-01-11 11:08:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-11 11:08:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 329. [2019-01-11 11:08:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 11:08:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2019-01-11 11:08:29,741 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 324 [2019-01-11 11:08:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:29,741 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2019-01-11 11:08:29,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-11 11:08:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2019-01-11 11:08:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-01-11 11:08:29,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:29,743 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 1, 1] [2019-01-11 11:08:29,743 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:29,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2048213615, now seen corresponding path program 81 times [2019-01-11 11:08:29,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:29,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:29,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:29,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:33,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:33,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:33,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:33,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:33,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:33,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:33,308 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:33,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:33,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:33,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:33,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:33,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:33,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:33,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:33,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:37,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:41,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-01-11 11:08:41,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:41,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-11 11:08:41,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-11 11:08:41,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:08:41,442 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 166 states. [2019-01-11 11:08:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:42,111 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-11 11:08:42,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-11 11:08:42,112 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 328 [2019-01-11 11:08:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:42,113 INFO L225 Difference]: With dead ends: 335 [2019-01-11 11:08:42,113 INFO L226 Difference]: Without dead ends: 334 [2019-01-11 11:08:42,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 490 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:08:42,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-11 11:08:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 333. [2019-01-11 11:08:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-01-11 11:08:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2019-01-11 11:08:42,119 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 328 [2019-01-11 11:08:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:42,119 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2019-01-11 11:08:42,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-11 11:08:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2019-01-11 11:08:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-01-11 11:08:42,120 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:42,121 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 1, 1] [2019-01-11 11:08:42,121 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:42,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash 265585448, now seen corresponding path program 82 times [2019-01-11 11:08:42,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:42,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:42,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:42,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:42,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:45,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:45,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:45,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:45,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:45,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:45,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:45,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:45,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:45,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:45,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:45,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:45,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:49,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:49,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:54,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:54,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-01-11 11:08:54,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:54,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-11 11:08:54,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-11 11:08:54,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 11:08:54,210 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 168 states. [2019-01-11 11:08:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:54,857 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2019-01-11 11:08:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 11:08:54,857 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 332 [2019-01-11 11:08:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:54,859 INFO L225 Difference]: With dead ends: 339 [2019-01-11 11:08:54,859 INFO L226 Difference]: Without dead ends: 338 [2019-01-11 11:08:54,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 496 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 11:08:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-01-11 11:08:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 337. [2019-01-11 11:08:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-11 11:08:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-11 11:08:54,865 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 332 [2019-01-11 11:08:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:54,865 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-11 11:08:54,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-11 11:08:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-11 11:08:54,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-11 11:08:54,866 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:54,866 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 1, 1] [2019-01-11 11:08:54,866 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:54,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1042464609, now seen corresponding path program 83 times [2019-01-11 11:08:54,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:54,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:54,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:58,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:58,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:58,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:58,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:58,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:08:58,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:08:58,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-11 11:08:58,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:58,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:58,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:58,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:58,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:58,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:02,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:02,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:07,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:07,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-01-11 11:09:07,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:07,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-11 11:09:07,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-11 11:09:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:09:07,089 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 170 states. [2019-01-11 11:09:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:07,849 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2019-01-11 11:09:07,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:09:07,850 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 336 [2019-01-11 11:09:07,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:07,851 INFO L225 Difference]: With dead ends: 343 [2019-01-11 11:09:07,851 INFO L226 Difference]: Without dead ends: 342 [2019-01-11 11:09:07,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 502 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:09:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-11 11:09:07,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2019-01-11 11:09:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 11:09:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-11 11:09:07,857 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 336 [2019-01-11 11:09:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:07,858 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-11 11:09:07,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-11 11:09:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-11 11:09:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-11 11:09:07,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:07,859 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 1, 1] [2019-01-11 11:09:07,859 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:07,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash -434751718, now seen corresponding path program 84 times [2019-01-11 11:09:07,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:07,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:07,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:11,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:11,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:11,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:11,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:11,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:11,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:11,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:09:11,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:09:11,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:09:11,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:11,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:11,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:11,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:11,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:11,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:15,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:20,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:20,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-01-11 11:09:20,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:20,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-11 11:09:20,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-11 11:09:20,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-11 11:09:20,007 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 172 states. [2019-01-11 11:09:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:20,792 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2019-01-11 11:09:20,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 11:09:20,792 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 340 [2019-01-11 11:09:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:20,794 INFO L225 Difference]: With dead ends: 347 [2019-01-11 11:09:20,794 INFO L226 Difference]: Without dead ends: 346 [2019-01-11 11:09:20,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 508 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-01-11 11:09:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-01-11 11:09:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2019-01-11 11:09:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-01-11 11:09:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2019-01-11 11:09:20,801 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 340 [2019-01-11 11:09:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:20,802 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2019-01-11 11:09:20,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-11 11:09:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2019-01-11 11:09:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-01-11 11:09:20,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:20,803 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 1, 1] [2019-01-11 11:09:20,804 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:20,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:20,804 INFO L82 PathProgramCache]: Analyzing trace with hash -207279533, now seen corresponding path program 85 times [2019-01-11 11:09:20,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:20,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:20,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:20,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:24,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:24,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:24,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:24,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:24,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:24,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:24,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:24,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:09:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:24,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:24,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:24,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:24,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:24,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:28,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:28,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:33,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:33,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-01-11 11:09:33,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:33,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-11 11:09:33,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-11 11:09:33,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:09:33,049 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 174 states. [2019-01-11 11:09:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:33,822 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-11 11:09:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-11 11:09:33,822 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 344 [2019-01-11 11:09:33,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:33,824 INFO L225 Difference]: With dead ends: 351 [2019-01-11 11:09:33,825 INFO L226 Difference]: Without dead ends: 350 [2019-01-11 11:09:33,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 772 GetRequests, 514 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:09:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-11 11:09:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2019-01-11 11:09:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-01-11 11:09:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2019-01-11 11:09:33,831 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 344 [2019-01-11 11:09:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:33,832 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2019-01-11 11:09:33,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-11 11:09:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2019-01-11 11:09:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-01-11 11:09:33,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:33,833 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 1, 1] [2019-01-11 11:09:33,834 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -307898100, now seen corresponding path program 86 times [2019-01-11 11:09:33,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:33,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:33,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:33,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:37,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:37,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:37,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:37,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:37,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:37,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:37,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:09:37,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:09:38,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-11 11:09:38,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:38,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:38,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:38,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:38,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:38,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:42,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:46,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:46,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-01-11 11:09:46,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:46,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-11 11:09:46,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-11 11:09:46,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-11 11:09:46,783 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 176 states. [2019-01-11 11:09:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:47,505 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-11 11:09:47,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 11:09:47,505 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 348 [2019-01-11 11:09:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:47,507 INFO L225 Difference]: With dead ends: 355 [2019-01-11 11:09:47,507 INFO L226 Difference]: Without dead ends: 354 [2019-01-11 11:09:47,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 781 GetRequests, 520 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-01-11 11:09:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-11 11:09:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 353. [2019-01-11 11:09:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-01-11 11:09:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2019-01-11 11:09:47,514 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 348 [2019-01-11 11:09:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:47,514 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2019-01-11 11:09:47,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-11 11:09:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2019-01-11 11:09:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-01-11 11:09:47,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:47,515 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 1, 1] [2019-01-11 11:09:47,516 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2050063547, now seen corresponding path program 87 times [2019-01-11 11:09:47,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:47,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:47,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:47,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:51,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:51,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:51,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:51,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:51,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:51,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:09:51,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:09:51,290 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:09:51,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:51,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:51,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:51,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:51,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:51,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:55,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:00,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:00,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-01-11 11:10:00,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:00,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-01-11 11:10:00,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-01-11 11:10:00,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:10:00,307 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 178 states. [2019-01-11 11:10:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:01,012 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2019-01-11 11:10:01,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-11 11:10:01,012 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 352 [2019-01-11 11:10:01,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:01,014 INFO L225 Difference]: With dead ends: 359 [2019-01-11 11:10:01,014 INFO L226 Difference]: Without dead ends: 358 [2019-01-11 11:10:01,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 790 GetRequests, 526 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:10:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-11 11:10:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 357. [2019-01-11 11:10:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-11 11:10:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-11 11:10:01,020 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 352 [2019-01-11 11:10:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:01,020 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-11 11:10:01,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-01-11 11:10:01,021 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-11 11:10:01,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-11 11:10:01,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:01,022 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 1, 1] [2019-01-11 11:10:01,022 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:01,022 INFO L82 PathProgramCache]: Analyzing trace with hash 682977534, now seen corresponding path program 88 times [2019-01-11 11:10:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:01,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:01,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:01,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:01,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:04,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:04,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:04,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:04,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:04,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:04,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:04,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:04,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:04,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:04,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:10:04,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:04,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:04,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:09,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:13,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:13,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-01-11 11:10:13,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:13,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-01-11 11:10:13,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-01-11 11:10:13,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-11 11:10:13,691 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 180 states. [2019-01-11 11:10:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:14,549 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2019-01-11 11:10:14,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 11:10:14,549 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 356 [2019-01-11 11:10:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:14,551 INFO L225 Difference]: With dead ends: 363 [2019-01-11 11:10:14,551 INFO L226 Difference]: Without dead ends: 362 [2019-01-11 11:10:14,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 799 GetRequests, 532 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-01-11 11:10:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-11 11:10:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 361. [2019-01-11 11:10:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 11:10:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-11 11:10:14,557 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 356 [2019-01-11 11:10:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:14,558 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-11 11:10:14,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-01-11 11:10:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-11 11:10:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-11 11:10:14,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:14,559 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 1, 1] [2019-01-11 11:10:14,559 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:14,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1915696585, now seen corresponding path program 89 times [2019-01-11 11:10:14,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:14,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:14,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:14,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:14,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:18,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:18,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:18,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:18,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:18,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:18,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:18,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:10:18,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:10:18,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-01-11 11:10:18,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:18,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:18,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:10:18,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:19,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:19,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:23,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:27,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:27,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-01-11 11:10:27,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:27,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-01-11 11:10:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-01-11 11:10:27,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 11:10:27,979 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 182 states. [2019-01-11 11:10:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:28,735 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2019-01-11 11:10:28,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-11 11:10:28,735 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 360 [2019-01-11 11:10:28,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:28,738 INFO L225 Difference]: With dead ends: 367 [2019-01-11 11:10:28,738 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 11:10:28,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 808 GetRequests, 538 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 11:10:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 11:10:28,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2019-01-11 11:10:28,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-01-11 11:10:28,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2019-01-11 11:10:28,744 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 360 [2019-01-11 11:10:28,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:28,744 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2019-01-11 11:10:28,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-01-11 11:10:28,744 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2019-01-11 11:10:28,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-01-11 11:10:28,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:28,746 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 90, 90, 1, 1] [2019-01-11 11:10:28,746 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:28,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:28,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1198974704, now seen corresponding path program 90 times [2019-01-11 11:10:28,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:28,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:28,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:28,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:28,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:32,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:32,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:32,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:32,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:32,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:32,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:10:32,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:10:32,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:10:32,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:33,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:33,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:10:33,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:33,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:37,928 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:37,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:42,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:42,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-01-11 11:10:42,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:42,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-01-11 11:10:42,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-01-11 11:10:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-11 11:10:42,433 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 184 states. [2019-01-11 11:10:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:43,152 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-11 11:10:43,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-11 11:10:43,153 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 364 [2019-01-11 11:10:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:43,154 INFO L225 Difference]: With dead ends: 371 [2019-01-11 11:10:43,154 INFO L226 Difference]: Without dead ends: 370 [2019-01-11 11:10:43,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 544 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-01-11 11:10:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-11 11:10:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 369. [2019-01-11 11:10:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-01-11 11:10:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2019-01-11 11:10:43,160 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 364 [2019-01-11 11:10:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:43,160 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2019-01-11 11:10:43,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-01-11 11:10:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2019-01-11 11:10:43,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-01-11 11:10:43,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:43,162 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 91, 91, 1, 1] [2019-01-11 11:10:43,162 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:43,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:43,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1390280489, now seen corresponding path program 91 times [2019-01-11 11:10:43,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:43,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:43,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:43,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:43,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:47,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:47,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:47,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:47,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:47,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:47,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:47,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:47,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:47,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:47,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:10:47,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:47,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:47,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:52,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:52,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:56,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:56,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-01-11 11:10:56,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:56,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-01-11 11:10:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-01-11 11:10:56,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:10:56,330 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 186 states. [2019-01-11 11:10:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:57,071 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-11 11:10:57,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-11 11:10:57,072 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 368 [2019-01-11 11:10:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:57,074 INFO L225 Difference]: With dead ends: 375 [2019-01-11 11:10:57,074 INFO L226 Difference]: Without dead ends: 374 [2019-01-11 11:10:57,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 826 GetRequests, 550 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:10:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-11 11:10:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2019-01-11 11:10:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-01-11 11:10:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2019-01-11 11:10:57,080 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 368 [2019-01-11 11:10:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:57,080 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2019-01-11 11:10:57,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-01-11 11:10:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2019-01-11 11:10:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-01-11 11:10:57,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:57,081 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 92, 92, 1, 1] [2019-01-11 11:10:57,082 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:57,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1474538782, now seen corresponding path program 92 times [2019-01-11 11:10:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:57,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:57,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:00,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:00,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:00,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:00,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:00,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:00,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:00,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:00,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:01,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-01-11 11:11:01,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:01,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:01,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:11:01,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:01,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:06,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:10,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:10,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-01-11 11:11:10,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:10,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-01-11 11:11:10,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-01-11 11:11:10,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-11 11:11:10,662 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 188 states. [2019-01-11 11:11:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:11,472 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2019-01-11 11:11:11,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 11:11:11,472 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 372 [2019-01-11 11:11:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:11,474 INFO L225 Difference]: With dead ends: 379 [2019-01-11 11:11:11,474 INFO L226 Difference]: Without dead ends: 378 [2019-01-11 11:11:11,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 556 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-01-11 11:11:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-01-11 11:11:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 377. [2019-01-11 11:11:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-11 11:11:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-11 11:11:11,480 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 372 [2019-01-11 11:11:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:11,480 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-11 11:11:11,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-01-11 11:11:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-11 11:11:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-11 11:11:11,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:11,482 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 93, 93, 1, 1] [2019-01-11 11:11:11,482 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash -903339493, now seen corresponding path program 93 times [2019-01-11 11:11:11,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:11,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:11,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:11,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:11,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:15,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:15,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:15,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:15,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:15,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:15,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:15,443 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:11:15,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:11:15,554 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:11:15,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:15,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:15,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:11:15,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:15,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:20,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:25,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-01-11 11:11:25,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:25,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-01-11 11:11:25,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-01-11 11:11:25,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 11:11:25,251 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 190 states. [2019-01-11 11:11:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:25,994 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2019-01-11 11:11:25,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-11 11:11:25,995 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 376 [2019-01-11 11:11:25,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:25,997 INFO L225 Difference]: With dead ends: 383 [2019-01-11 11:11:25,997 INFO L226 Difference]: Without dead ends: 382 [2019-01-11 11:11:25,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 562 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 11:11:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-01-11 11:11:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-01-11 11:11:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-11 11:11:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-11 11:11:26,004 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 376 [2019-01-11 11:11:26,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:26,005 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-11 11:11:26,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-01-11 11:11:26,005 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-11 11:11:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-11 11:11:26,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:26,006 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 94, 94, 1, 1] [2019-01-11 11:11:26,007 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:26,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1456975060, now seen corresponding path program 94 times [2019-01-11 11:11:26,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:26,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:26,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:26,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:30,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:30,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:30,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:30,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:30,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:30,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:30,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:30,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:30,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:30,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:11:30,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:30,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:30,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:35,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:40,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:40,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-01-11 11:11:40,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:40,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-01-11 11:11:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-01-11 11:11:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-01-11 11:11:40,095 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 192 states. [2019-01-11 11:11:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:40,905 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2019-01-11 11:11:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-11 11:11:40,906 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 380 [2019-01-11 11:11:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:40,908 INFO L225 Difference]: With dead ends: 387 [2019-01-11 11:11:40,908 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 11:11:40,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 568 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-01-11 11:11:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 11:11:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 385. [2019-01-11 11:11:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-01-11 11:11:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 385 transitions. [2019-01-11 11:11:40,915 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 385 transitions. Word has length 380 [2019-01-11 11:11:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:40,916 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 385 transitions. [2019-01-11 11:11:40,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-01-11 11:11:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 385 transitions. [2019-01-11 11:11:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-01-11 11:11:40,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:40,917 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 95, 95, 1, 1] [2019-01-11 11:11:40,917 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:40,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1763626227, now seen corresponding path program 95 times [2019-01-11 11:11:40,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:40,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:40,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:45,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:45,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:45,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:45,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:45,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:45,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:45,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:45,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:46,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-01-11 11:11:46,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:46,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:46,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:11:46,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:46,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:51,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:55,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:55,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-01-11 11:11:55,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:55,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-01-11 11:11:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-01-11 11:11:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:11:55,831 INFO L87 Difference]: Start difference. First operand 385 states and 385 transitions. Second operand 194 states. [2019-01-11 11:11:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:56,693 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-11 11:11:56,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-11 11:11:56,695 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 384 [2019-01-11 11:11:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:56,697 INFO L225 Difference]: With dead ends: 391 [2019-01-11 11:11:56,697 INFO L226 Difference]: Without dead ends: 390 [2019-01-11 11:11:56,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 862 GetRequests, 574 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:11:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-11 11:11:56,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 389. [2019-01-11 11:11:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-01-11 11:11:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2019-01-11 11:11:56,704 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 384 [2019-01-11 11:11:56,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:56,704 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2019-01-11 11:11:56,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-01-11 11:11:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2019-01-11 11:11:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-01-11 11:11:56,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:56,706 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 96, 96, 1, 1] [2019-01-11 11:11:56,706 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:56,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 232453318, now seen corresponding path program 96 times [2019-01-11 11:11:56,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:56,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:56,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:01,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:01,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:01,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:01,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:01,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:01,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:01,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:12:01,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:12:01,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:12:01,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:01,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:01,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:01,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:01,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:01,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:06,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:11,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:11,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-01-11 11:12:11,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:11,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-01-11 11:12:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-01-11 11:12:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-01-11 11:12:11,233 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 196 states. [2019-01-11 11:12:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:12,071 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-11 11:12:12,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 11:12:12,072 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 388 [2019-01-11 11:12:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:12,073 INFO L225 Difference]: With dead ends: 395 [2019-01-11 11:12:12,073 INFO L226 Difference]: Without dead ends: 394 [2019-01-11 11:12:12,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 580 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-01-11 11:12:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-11 11:12:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2019-01-11 11:12:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-01-11 11:12:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2019-01-11 11:12:12,080 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 388 [2019-01-11 11:12:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:12,080 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2019-01-11 11:12:12,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-01-11 11:12:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2019-01-11 11:12:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-11 11:12:12,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:12,082 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 97, 97, 1, 1] [2019-01-11 11:12:12,082 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:12,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:12,082 INFO L82 PathProgramCache]: Analyzing trace with hash 171651583, now seen corresponding path program 97 times [2019-01-11 11:12:12,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:12,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:12,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:12,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:16,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:16,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:16,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:16,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:16,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:16,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:16,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:16,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:16,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:16,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:16,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:16,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:16,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:22,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:26,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:26,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-01-11 11:12:26,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:26,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-01-11 11:12:26,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-01-11 11:12:26,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-01-11 11:12:26,936 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 198 states. [2019-01-11 11:12:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:27,721 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2019-01-11 11:12:27,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-11 11:12:27,722 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 392 [2019-01-11 11:12:27,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:27,723 INFO L225 Difference]: With dead ends: 399 [2019-01-11 11:12:27,723 INFO L226 Difference]: Without dead ends: 398 [2019-01-11 11:12:27,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 586 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-01-11 11:12:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-01-11 11:12:27,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2019-01-11 11:12:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-11 11:12:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-11 11:12:27,729 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 392 [2019-01-11 11:12:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:27,730 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-11 11:12:27,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-01-11 11:12:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-11 11:12:27,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-11 11:12:27,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:27,731 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 98, 98, 1, 1] [2019-01-11 11:12:27,732 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:27,732 INFO L82 PathProgramCache]: Analyzing trace with hash 894970552, now seen corresponding path program 98 times [2019-01-11 11:12:27,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:27,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:27,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:27,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:27,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:32,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:32,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:32,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:32,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:32,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:32,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:32,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:12:32,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:12:33,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-01-11 11:12:33,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:33,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:33,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:33,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:33,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:33,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:38,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:43,215 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:43,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:43,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-01-11 11:12:43,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:43,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-01-11 11:12:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-01-11 11:12:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-01-11 11:12:43,239 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 200 states. [2019-01-11 11:12:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:44,130 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2019-01-11 11:12:44,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-11 11:12:44,130 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 396 [2019-01-11 11:12:44,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:44,133 INFO L225 Difference]: With dead ends: 403 [2019-01-11 11:12:44,133 INFO L226 Difference]: Without dead ends: 402 [2019-01-11 11:12:44,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 592 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-01-11 11:12:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-11 11:12:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 401. [2019-01-11 11:12:44,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-11 11:12:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-11 11:12:44,140 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 396 [2019-01-11 11:12:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:44,141 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-11 11:12:44,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-01-11 11:12:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-11 11:12:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-11 11:12:44,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:44,143 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 99, 99, 1, 1] [2019-01-11 11:12:44,143 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 594026225, now seen corresponding path program 99 times [2019-01-11 11:12:44,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:44,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:44,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:44,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:48,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:48,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:48,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:48,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:48,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:48,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:48,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:12:48,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:12:48,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:12:48,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:48,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:48,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:48,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:48,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:48,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:54,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:54,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-01-11 11:12:58,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:58,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-01-11 11:12:58,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-01-11 11:12:58,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:12:58,878 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 202 states. [2019-01-11 11:12:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:59,819 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2019-01-11 11:12:59,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 11:12:59,819 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 400 [2019-01-11 11:12:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:59,821 INFO L225 Difference]: With dead ends: 407 [2019-01-11 11:12:59,821 INFO L226 Difference]: Without dead ends: 406 [2019-01-11 11:12:59,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 898 GetRequests, 599 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:12:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-01-11 11:12:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 405. [2019-01-11 11:12:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-01-11 11:12:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2019-01-11 11:12:59,828 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 400 [2019-01-11 11:12:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:59,829 INFO L480 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2019-01-11 11:12:59,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-01-11 11:12:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2019-01-11 11:12:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-01-11 11:12:59,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:59,831 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 100, 100, 1, 1] [2019-01-11 11:12:59,831 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:12:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:59,832 INFO L82 PathProgramCache]: Analyzing trace with hash -478064982, now seen corresponding path program 100 times [2019-01-11 11:12:59,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:59,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:59,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:59,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:59,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 19603 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:04,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:04,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:04,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:04,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:04,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:04,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:04,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:04,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:04,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:04,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 20000 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:09,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:09,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 104 [2019-01-11 11:13:09,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:09,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-11 11:13:09,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-11 11:13:09,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2019-01-11 11:13:09,733 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 105 states. [2019-01-11 11:13:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:11,121 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2019-01-11 11:13:11,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-11 11:13:11,121 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 404 [2019-01-11 11:13:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:11,125 INFO L225 Difference]: With dead ends: 408 [2019-01-11 11:13:11,125 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 11:13:11,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 706 SyntacticMatches, 100 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5643 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=5362, Invalid=5768, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:13:11,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 11:13:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 11:13:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 11:13:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 11:13:11,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 404 [2019-01-11 11:13:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:11,128 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 11:13:11,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-11 11:13:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 11:13:11,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 11:13:11,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 11:13:11,243 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-01-11 11:13:14,063 WARN L181 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-01-11 11:13:14,071 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 3 24) no Hoare annotation was computed. [2019-01-11 11:13:14,071 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 3 24) no Hoare annotation was computed. [2019-01-11 11:13:14,072 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-11 11:13:14,072 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2019-01-11 11:13:14,072 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2019-01-11 11:13:14,074 INFO L444 ceAbstractionStarter]: At program point L13-1(lines 13 22) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 0) .cse0 (= main_p.offset main_q.offset)) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-01-11 11:13:14,074 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 3 24) no Hoare annotation was computed. [2019-01-11 11:13:14,075 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 17) no Hoare annotation was computed. [2019-01-11 11:13:14,130 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 11:13:14 BoogieIcfgContainer [2019-01-11 11:13:14,130 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 11:13:14,131 INFO L168 Benchmark]: Toolchain (without parser) took 727652.71 ms. Allocated memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 105.3 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-11 11:13:14,132 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory is still 106.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:13:14,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.64 ms. Allocated memory is still 137.9 MB. Free memory was 105.3 MB in the beginning and 103.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-01-11 11:13:14,132 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 ms. Allocated memory is still 137.9 MB. Free memory was 102.9 MB in the beginning and 101.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:13:14,133 INFO L168 Benchmark]: RCFGBuilder took 319.16 ms. Allocated memory is still 137.9 MB. Free memory was 101.8 MB in the beginning and 91.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-01-11 11:13:14,133 INFO L168 Benchmark]: TraceAbstraction took 727236.58 ms. Allocated memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 91.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-01-11 11:13:14,135 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.18 ms. Allocated memory is still 137.9 MB. Free memory is still 106.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.64 ms. Allocated memory is still 137.9 MB. Free memory was 105.3 MB in the beginning and 103.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.16 ms. Allocated memory is still 137.9 MB. Free memory was 102.9 MB in the beginning and 101.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 319.16 ms. Allocated memory is still 137.9 MB. Free memory was 101.8 MB in the beginning and 91.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 727236.58 ms. Allocated memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 91.6 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: 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: 13]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 0 && 400 <= #length[q!base]) && p!offset == q!offset)) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 727.0s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 44.6s AutomataDifference, 0.0s DeadEndRemovalTime, 2.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 403 SDtfs, 7610 SDslu, 7951 SDs, 0 SdLazy, 28139 SolverSat, 355 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46154 GetRequests, 30803 SyntacticMatches, 2649 SemanticMatches, 12702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303267 ImplicationChecksByTransitivity, 619.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=405occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 13.8s SatisfiabilityAnalysisTime, 653.1s InterpolantComputationTime, 41204 NumberOfCodeBlocks, 41204 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 61503 ConstructedInterpolants, 0 QuantifiedInterpolants, 126003756 SizeOfPredicates, 596 NumberOfNonLiveVariables, 37650 ConjunctsInSsa, 15943 ConjunctsInUnsatCore, 301 InterpolantComputations, 1 PerfectInterpolantSequences, 59603/2045250 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...