java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:57:20,345 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:57:20,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:57:20,358 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:57:20,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:57:20,360 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:57:20,361 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:57:20,363 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:57:20,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:57:20,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:57:20,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:57:20,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:57:20,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:57:20,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:57:20,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:57:20,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:57:20,371 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:57:20,373 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:57:20,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:57:20,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:57:20,378 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:57:20,380 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:57:20,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:57:20,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:57:20,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:57:20,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:57:20,385 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:57:20,386 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:57:20,387 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:57:20,388 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:57:20,388 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:57:20,389 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:57:20,389 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:57:20,390 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:57:20,391 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:57:20,391 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:57:20,392 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:57:20,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:57:20,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:57:20,406 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:57:20,406 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:57:20,409 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:57:20,409 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:57:20,409 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:57:20,410 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:57:20,410 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:57:20,410 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:57:20,410 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:57:20,411 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:57:20,411 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:57:20,411 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:57:20,411 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:57:20,414 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:57:20,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:57:20,414 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:57:20,415 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:57:20,415 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:57:20,415 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:57:20,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:57:20,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:57:20,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:57:20,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:57:20,418 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:57:20,418 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:57:20,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:57:20,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:57:20,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:57:20,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:57:20,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:57:20,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:57:20,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:57:20,420 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:57:20,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:57:20,420 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:57:20,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:57:20,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:57:20,420 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:57:20,422 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:57:20,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:57:20,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:57:20,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:57:20,487 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:57:20,488 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:57:20,488 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl [2018-12-03 16:57:20,489 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl' [2018-12-03 16:57:20,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:57:20,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:57:20,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:57:20,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:57:20,523 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:57:20,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,554 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:57:20,554 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:57:20,554 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:57:20,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:57:20,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:57:20,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:57:20,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:57:20,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,577 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... [2018-12-03 16:57:20,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:57:20,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:57:20,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:57:20,579 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:57:20,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:57:20,654 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:57:20,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:57:20,655 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:57:20,869 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:57:20,869 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:57:20,870 INFO L202 PluginConnector]: Adding new model MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:57:20 BoogieIcfgContainer [2018-12-03 16:57:20,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:57:20,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:57:20,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:57:20,875 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:57:20,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:20" (1/2) ... [2018-12-03 16:57:20,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f38c546 and model type MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:57:20, skipping insertion in model container [2018-12-03 16:57:20,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:57:20" (2/2) ... [2018-12-03 16:57:20,878 INFO L112 eAbstractionObserver]: Analyzing ICFG MonadicInvariant01.bpl [2018-12-03 16:57:20,890 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:57:20,900 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:57:20,919 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:57:20,958 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:57:20,958 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:57:20,958 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:57:20,959 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:57:20,959 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:57:20,959 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:57:20,959 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:57:20,959 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:57:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:57:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:57:20,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:20,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:57:20,999 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:21,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 16:57:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:21,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:21,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:57:21,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:57:21,162 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:57:21,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:57:21,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:57:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:57:21,181 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:57:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:21,279 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:57:21,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:57:21,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:57:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:21,292 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:57:21,293 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:57:21,297 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 [2018-12-03 16:57:21,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:57:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:57:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:57:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:57:21,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 16:57:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:21,338 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:57:21,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:57:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:57:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:57:21,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:21,339 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:57:21,340 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:21,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 16:57:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:21,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:21,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:21,494 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 16:57:21,495 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 16:57:21,538 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:57:21,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:57:21,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:57:21,670 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:57:21,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:21,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:57:21,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:21,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:21,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:21,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:21,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:21,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-03 16:57:21,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:21,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:57:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:57:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:57:21,908 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 16:57:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:21,957 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:57:21,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:57:21,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 16:57:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:21,958 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:57:21,959 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:57:21,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:57:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:57:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:57:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:57:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:57:21,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 16:57:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:21,964 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:57:21,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:57:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:57:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:57:21,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:21,965 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 16:57:21,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:21,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:21,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 16:57:21,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:21,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:22,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:22,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:22,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:22,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:22,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:22,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:22,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:22,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:22,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:57:22,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:22,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:22,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-03 16:57:22,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:22,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:57:22,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:57:22,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:57:22,534 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 16:57:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:22,566 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:57:22,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:57:22,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 16:57:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:22,569 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:57:22,569 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:57:22,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:57:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:57:22,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:57:22,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:57:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:57:22,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 16:57:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:22,574 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:57:22,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:57:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:57:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:57:22,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:22,576 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 16:57:22,576 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:22,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:22,576 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 16:57:22,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:22,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:22,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:22,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:22,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:22,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:22,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:22,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:22,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:22,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:22,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:22,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:22,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:22,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-03 16:57:22,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:22,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:57:22,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:57:22,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:57:22,947 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 16:57:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:22,999 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:57:23,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:57:23,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 16:57:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:23,001 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:57:23,002 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:57:23,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:57:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:57:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:57:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:57:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:57:23,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 16:57:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:23,006 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:57:23,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:57:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:57:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:23,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:23,007 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 16:57:23,008 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:23,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 16:57:23,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:23,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:23,100 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:23,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:23,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:23,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:23,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:23,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:23,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:23,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:23,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-03 16:57:23,723 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:23,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:57:23,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:57:23,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:57:23,724 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 16:57:23,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:23,817 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:57:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:57:23,817 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 16:57:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:23,818 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:57:23,818 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:57:23,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:57:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:57:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:57:23,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:57:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:57:23,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 16:57:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:23,823 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:57:23,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:57:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:57:23,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:57:23,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:23,824 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 16:57:23,825 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:23,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:23,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 16:57:23,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:23,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:23,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:23,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:23,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:23,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:23,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:23,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:23,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:23,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:57:23,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:23,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:24,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:24,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-03 16:57:24,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:24,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:57:24,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:57:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:24,236 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 16:57:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:24,309 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:57:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:57:24,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 16:57:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:24,312 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:57:24,312 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:57:24,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:57:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:57:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:57:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:57:24,318 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 16:57:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:24,318 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:57:24,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:57:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:57:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:57:24,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:24,319 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 16:57:24,319 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:24,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 16:57:24,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:24,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:24,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:24,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:24,465 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:24,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:24,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:24,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:24,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:24,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 16:57:24,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:24,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:57:24,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:57:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:57:24,779 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 16:57:24,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:24,862 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:57:24,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:57:24,862 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 16:57:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:24,863 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:57:24,864 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:57:24,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:57:24,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:57:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:57:24,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:57:24,869 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 16:57:24,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:24,870 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:57:24,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:57:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:57:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:57:24,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:24,871 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 16:57:24,871 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:24,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:24,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 16:57:24,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:24,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:24,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:24,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:24,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:24,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:24,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:24,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:25,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-03 16:57:25,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:25,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:57:25,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:57:25,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:57:25,379 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 16:57:25,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:25,425 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:57:25,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:57:25,426 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 16:57:25,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:25,427 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:57:25,427 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:57:25,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:57:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:57:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:57:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:57:25,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:57:25,433 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 16:57:25,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:25,433 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:57:25,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:57:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:57:25,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:57:25,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:25,434 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 16:57:25,434 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:25,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:25,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 16:57:25,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:25,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:25,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,551 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:25,551 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:25,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:25,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:25,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:25,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:25,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:57:25,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:25,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:25,722 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:26,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:26,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-03 16:57:26,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:26,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:57:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:57:26,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:57:26,078 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 16:57:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:26,142 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:57:26,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:26,142 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 16:57:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:26,144 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:57:26,144 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:57:26,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:57:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:57:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:57:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:57:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:57:26,149 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 16:57:26,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:26,150 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:57:26,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:57:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:57:26,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:57:26,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:26,151 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 16:57:26,151 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:26,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:26,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 16:57:26,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:26,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:26,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:26,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:26,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:26,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:26,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:26,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:26,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:26,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:26,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:26,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:26,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:27,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:27,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-03 16:57:27,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:27,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:57:27,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:57:27,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:57:27,122 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 16:57:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:27,368 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:57:27,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:57:27,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 16:57:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:27,369 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:57:27,369 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:57:27,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:57:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:57:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:57:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:57:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:57:27,382 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 16:57:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:27,383 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:57:27,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:57:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:57:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:57:27,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:27,384 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 16:57:27,384 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:27,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:27,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 16:57:27,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:27,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:27,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:27,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:27,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:27,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:27,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:27,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:27,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:27,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:28,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:28,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-03 16:57:28,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:28,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:57:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:57:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:57:28,191 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 16:57:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:28,537 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:57:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:57:28,538 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 16:57:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:28,538 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:57:28,538 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:57:28,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:57:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:57:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:57:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:57:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:57:28,598 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 16:57:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:28,598 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:57:28,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:57:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:57:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:57:28,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:28,599 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 16:57:28,599 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:28,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 16:57:28,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:28,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:28,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:28,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:28,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:28,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:28,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:28,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:28,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:28,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:28,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 16:57:28,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:28,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:28,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:29,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:29,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-03 16:57:29,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:29,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:57:29,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:57:29,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:57:29,628 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 16:57:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:29,703 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:57:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:57:29,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 16:57:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:29,705 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:57:29,705 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:29,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:57:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:57:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:57:29,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:57:29,711 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 16:57:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:29,711 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:57:29,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:57:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:57:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:57:29,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:29,712 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 16:57:29,712 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:29,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 16:57:29,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:29,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:29,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:29,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:29,908 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:29,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:29,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:29,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:29,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:29,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:29,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:29,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:29,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:29,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:30,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:30,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:30,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-03 16:57:30,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:30,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:57:30,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:57:30,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:57:30,546 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 16:57:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:30,628 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:57:30,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:57:30,628 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 16:57:30,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:30,629 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:30,630 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:30,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:57:30,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:57:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:57:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:57:30,635 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 16:57:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:30,637 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:57:30,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:57:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:57:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:57:30,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:30,638 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 16:57:30,638 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:30,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:30,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 16:57:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:30,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:30,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:30,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:30,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:30,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:30,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:30,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:30,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:30,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:30,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:30,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:31,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:32,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:32,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-03 16:57:32,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:32,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:57:32,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:57:32,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:57:32,070 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 16:57:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:32,146 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:57:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:57:32,147 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 16:57:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:32,148 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:57:32,148 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:32,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:57:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:32,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:57:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:57:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:57:32,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 16:57:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:32,154 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:57:32,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:57:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:57:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:57:32,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:32,156 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 16:57:32,156 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:32,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 16:57:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:32,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:32,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:32,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:32,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:32,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:32,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:32,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:32,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:32,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:32,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 16:57:32,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:32,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:33,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:33,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:33,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-03 16:57:33,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:33,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:57:33,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:57:33,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:57:33,680 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 16:57:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:33,833 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:57:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:57:33,834 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 16:57:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:33,835 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:57:33,835 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:57:33,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:57:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:57:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:57:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:57:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:57:33,841 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 16:57:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:33,841 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:57:33,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:57:33,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:57:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:57:33,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:33,843 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 16:57:33,843 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:33,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 16:57:33,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:33,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:33,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:34,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:34,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:34,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:34,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:34,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:34,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:34,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:34,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:35,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-03 16:57:35,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:35,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:57:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:57:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:57:35,176 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 16:57:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:35,293 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:57:35,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:57:35,293 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 16:57:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:35,294 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:57:35,294 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:57:35,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:57:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:57:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:57:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:57:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:57:35,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 16:57:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:35,301 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:57:35,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:57:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:57:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:57:35,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:35,302 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 16:57:35,302 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:35,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 16:57:35,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:35,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:35,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:35,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:35,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:35,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:35,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:35,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:35,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:35,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:35,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:35,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:35,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:36,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:36,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-03 16:57:36,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:36,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:57:36,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:57:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:57:36,365 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 16:57:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:36,444 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 16:57:36,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:57:36,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 16:57:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:36,445 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:57:36,446 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:57:36,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:57:36,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:57:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:57:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:57:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 16:57:36,452 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 16:57:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:36,452 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 16:57:36,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:57:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 16:57:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:57:36,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:36,453 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 16:57:36,453 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:36,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 16:57:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:36,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:36,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:36,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:36,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:36,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:36,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:36,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:36,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:36,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:36,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:36,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:36,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:36,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 16:57:36,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:36,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:37,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-03 16:57:37,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:37,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:57:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:57:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:57:37,588 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 16:57:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:37,813 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:57:37,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:57:37,814 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 16:57:37,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:37,815 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:57:37,815 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:57:37,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:57:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:57:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:57:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:57:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 16:57:37,821 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 16:57:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:37,821 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 16:57:37,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:57:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 16:57:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:57:37,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:37,822 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 16:57:37,822 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:37,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:37,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 16:57:37,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:37,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:37,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:38,201 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:38,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:38,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:38,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:38,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:38,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:38,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:38,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:38,493 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:39,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:39,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-03 16:57:39,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:39,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:57:39,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:57:39,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:57:39,208 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 16:57:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:39,355 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 16:57:39,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:57:39,356 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 16:57:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:39,356 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:57:39,356 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:57:39,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:57:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:57:39,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:57:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:57:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 16:57:39,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 16:57:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:39,365 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 16:57:39,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:57:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 16:57:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:57:39,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:39,366 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 16:57:39,367 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:39,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:39,367 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 16:57:39,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:39,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:39,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:39,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:39,730 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:39,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:39,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:39,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:39,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:39,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:39,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:39,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:39,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:39,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:40,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:40,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:40,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-03 16:57:40,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:40,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:57:40,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:57:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:57:40,878 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 16:57:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:40,972 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:57:40,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:57:40,973 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 16:57:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:40,974 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:57:40,974 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:57:40,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:57:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:57:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:57:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:57:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 16:57:40,981 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 16:57:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:40,982 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 16:57:40,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:57:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 16:57:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:57:40,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:40,988 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 16:57:40,988 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:40,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:40,989 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 16:57:40,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:40,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:40,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:40,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:41,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:41,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:41,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:41,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:41,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:41,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:41,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:41,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:41,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 16:57:41,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:41,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:41,635 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:41,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:42,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:42,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-03 16:57:42,233 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:42,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:57:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:57:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:57:42,236 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 16:57:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:42,325 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 16:57:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:57:42,326 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 16:57:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:42,326 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:57:42,327 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:57:42,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:57:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:57:42,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:57:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:57:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 16:57:42,336 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 16:57:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:42,336 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 16:57:42,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:57:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 16:57:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:57:42,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:42,337 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 16:57:42,337 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:42,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 16:57:42,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:42,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:42,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:43,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:43,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:43,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:43,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:43,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:43,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:43,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:43,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:43,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:43,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:44,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:44,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-03 16:57:44,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:44,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:57:44,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:57:44,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:57:44,127 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-12-03 16:57:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:44,228 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:57:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:57:44,231 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-12-03 16:57:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:44,232 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:57:44,232 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:57:44,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:57:44,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:57:44,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:57:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:57:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 16:57:44,237 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 16:57:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:44,238 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 16:57:44,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:57:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 16:57:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:57:44,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:44,240 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 16:57:44,240 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:44,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:44,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 16:57:44,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:44,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:44,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:44,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:44,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:44,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:44,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:44,806 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:44,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:44,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:44,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:44,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:44,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:44,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:45,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:46,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:46,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-03 16:57:46,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:46,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:57:46,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:57:46,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:57:46,376 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-12-03 16:57:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:46,506 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 16:57:46,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:57:46,506 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-12-03 16:57:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:46,507 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:57:46,507 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:57:46,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:57:46,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:57:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:57:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:57:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 16:57:46,513 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 16:57:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:46,513 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 16:57:46,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:57:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 16:57:46,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:57:46,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:46,514 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 16:57:46,514 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:46,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 16:57:46,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:46,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:46,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:46,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:46,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:46,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:46,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:46,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:46,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:46,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:46,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:46,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:57:46,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:46,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:47,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:48,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-03 16:57:48,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:48,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:57:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:57:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:57:48,072 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-12-03 16:57:48,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:48,216 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:57:48,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:57:48,217 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-12-03 16:57:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:48,218 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:57:48,218 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:57:48,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:57:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:57:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:57:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:57:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 16:57:48,223 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 16:57:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:48,224 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 16:57:48,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:57:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 16:57:48,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:57:48,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:48,225 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 16:57:48,225 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:48,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 16:57:48,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:48,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:48,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:48,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:48,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:48,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:48,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:48,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:48,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:48,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:48,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:48,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:48,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:49,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:50,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:50,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-03 16:57:50,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:50,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:57:50,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:57:50,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:57:50,241 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-12-03 16:57:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:50,361 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 16:57:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:57:50,362 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-03 16:57:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:50,363 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:57:50,363 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:57:50,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:57:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:57:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:57:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:57:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 16:57:50,369 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 16:57:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:50,369 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 16:57:50,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:57:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 16:57:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:57:50,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:50,370 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 16:57:50,370 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:50,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:50,370 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 16:57:50,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:50,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:50,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:50,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:50,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:50,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:50,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:50,777 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:50,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:50,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:50,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:50,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:50,789 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:50,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:51,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:52,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:52,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-03 16:57:52,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:52,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:57:52,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:57:52,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:57:52,685 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-12-03 16:57:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:52,861 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 16:57:52,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:57:52,861 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-12-03 16:57:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:52,862 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:57:52,862 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:57:52,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:57:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:57:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:57:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:57:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 16:57:52,868 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 16:57:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:52,868 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 16:57:52,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:57:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 16:57:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:57:52,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:52,869 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 16:57:52,869 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:52,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 16:57:52,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:52,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:52,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:52,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:52,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:53,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:53,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:53,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:53,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:53,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:53,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:53,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:53,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:57:53,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:53,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:54,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:54,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-03 16:57:54,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:54,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:57:54,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:57:54,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:57:54,952 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-12-03 16:57:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:55,070 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 16:57:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:57:55,070 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-12-03 16:57:55,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:55,071 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:57:55,071 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:57:55,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:57:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:57:55,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:57:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:57:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 16:57:55,076 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 16:57:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:55,076 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 16:57:55,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:57:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 16:57:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:57:55,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:55,076 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 16:57:55,077 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:55,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 16:57:55,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:55,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:55,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:55,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:55,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:55,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:55,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:55,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:55,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:55,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:55,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:55,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:55,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:55,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:55,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:56,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:56,976 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:56,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:56,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-03 16:57:56,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:56,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:57:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:57:56,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:57:56,996 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-12-03 16:57:57,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:57,136 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 16:57:57,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:57:57,137 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-12-03 16:57:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:57,138 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:57:57,138 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:57:57,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:57:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:57:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:57:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:57:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 16:57:57,141 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 16:57:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:57,141 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 16:57:57,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:57:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 16:57:57,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:57:57,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:57,142 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 16:57:57,143 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:57,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:57,143 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 16:57:57,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:57,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:57,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:57,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:57,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:57,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:57,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:57,615 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:57,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:57,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:57,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:57,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:57,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:57,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:58,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:59,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-03 16:57:59,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:59,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:57:59,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:57:59,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:57:59,208 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-12-03 16:57:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:59,343 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 16:57:59,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:57:59,344 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-12-03 16:57:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:59,345 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:57:59,345 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:57:59,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:57:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:57:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:57:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:57:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 16:57:59,350 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 16:57:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:59,350 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 16:57:59,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:57:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 16:57:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 16:57:59,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:59,351 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 16:57:59,352 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:59,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:59,352 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 16:57:59,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:59,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:59,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:59,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:00,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:00,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:00,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:00,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:00,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:00,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:00,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:00,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:00,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:58:00,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:00,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:00,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:01,916 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-03 16:58:01,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:01,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:58:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:58:01,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:58:01,936 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-12-03 16:58:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:02,095 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 16:58:02,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:58:02,095 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-12-03 16:58:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:02,096 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:58:02,096 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:58:02,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:58:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:58:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:58:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:58:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 16:58:02,101 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 16:58:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:02,101 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 16:58:02,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:58:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 16:58:02,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:58:02,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:02,102 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 16:58:02,102 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:02,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:02,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 16:58:02,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:02,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:02,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:02,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:02,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:02,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:02,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:02,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:02,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:02,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:02,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:02,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:02,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:02,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:02,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:03,467 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:03,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:04,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:04,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-03 16:58:04,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:04,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:58:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:58:04,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:58:04,627 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-12-03 16:58:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:04,760 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 16:58:04,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:58:04,760 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-12-03 16:58:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:04,761 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:58:04,761 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:58:04,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:58:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:58:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:58:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:58:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 16:58:04,767 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 16:58:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:04,767 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 16:58:04,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:58:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 16:58:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:58:04,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:04,768 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 16:58:04,768 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:04,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 16:58:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:04,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:04,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:05,444 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:05,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:05,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:05,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:05,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:05,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:05,445 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:05,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:05,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:05,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:06,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:07,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:07,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-03 16:58:07,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:07,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:58:07,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:58:07,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:58:07,404 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-12-03 16:58:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:07,557 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 16:58:07,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:58:07,558 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-12-03 16:58:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:07,559 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:58:07,559 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:58:07,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:58:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:58:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:58:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:58:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 16:58:07,564 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 16:58:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:07,564 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 16:58:07,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:58:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 16:58:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:58:07,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:07,565 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 16:58:07,565 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:07,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 16:58:07,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:07,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:07,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:07,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:08,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:08,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:08,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:08,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:08,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:08,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:08,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:08,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:08,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 16:58:08,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:08,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:09,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:10,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:10,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-03 16:58:10,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:10,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:58:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:58:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:58:10,788 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-12-03 16:58:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:10,987 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 16:58:10,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:58:10,987 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-12-03 16:58:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:10,988 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:58:10,988 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:58:10,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:58:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:58:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:58:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:58:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 16:58:10,993 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 16:58:10,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:10,993 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 16:58:10,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:58:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 16:58:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:58:10,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:10,994 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 16:58:10,994 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:10,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 16:58:10,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:10,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:10,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:10,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:10,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:11,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:11,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:11,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:11,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:11,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:11,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:11,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:11,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:11,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:12,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:13,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:13,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-03 16:58:13,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:13,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:58:13,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:58:13,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:58:13,864 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-12-03 16:58:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:14,037 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 16:58:14,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:58:14,038 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-12-03 16:58:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:14,039 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:58:14,039 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:58:14,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:58:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:58:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:58:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:58:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 16:58:14,044 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 16:58:14,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:14,044 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 16:58:14,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:58:14,044 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 16:58:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:58:14,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:14,045 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 16:58:14,045 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:14,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:14,045 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 16:58:14,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:14,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:14,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:14,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:14,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:14,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:14,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:14,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:14,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:14,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:14,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:14,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:14,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:14,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:15,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:17,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:17,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-03 16:58:17,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:17,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:58:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:58:17,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:58:17,437 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-12-03 16:58:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:17,577 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 16:58:17,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:58:17,578 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-12-03 16:58:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:17,579 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:58:17,579 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:58:17,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:58:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:58:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:58:17,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:58:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 16:58:17,584 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 16:58:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:17,585 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 16:58:17,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:58:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 16:58:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:58:17,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:17,586 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 16:58:17,586 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:17,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:17,586 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 16:58:17,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:17,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:17,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:17,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:17,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:18,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:18,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:18,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:18,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:18,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:18,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:18,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:18,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:18,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:18,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:58:18,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:18,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:19,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:21,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:21,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-03 16:58:21,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:21,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:58:21,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:58:21,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:58:21,137 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-12-03 16:58:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:21,452 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 16:58:21,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:58:21,453 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-12-03 16:58:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:21,454 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:58:21,454 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:58:21,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:58:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:58:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:58:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:58:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 16:58:21,459 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 16:58:21,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:21,459 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 16:58:21,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:58:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 16:58:21,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:58:21,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:21,460 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 16:58:21,460 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:21,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:21,461 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 16:58:21,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:21,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:21,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:21,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:21,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:22,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:22,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:22,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:22,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:22,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:22,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:22,136 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:22,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:22,159 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:22,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:22,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:22,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:24,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:24,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:24,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-03 16:58:24,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:24,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:58:24,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:58:24,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:58:24,644 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-12-03 16:58:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:24,791 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 16:58:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:58:24,792 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-12-03 16:58:24,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:24,793 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:58:24,793 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:58:24,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:58:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:58:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:58:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:58:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 16:58:24,798 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 16:58:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:24,798 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 16:58:24,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:58:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 16:58:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:58:24,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:24,799 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 16:58:24,799 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:24,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 16:58:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:24,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:24,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:25,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:25,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:25,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:25,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:25,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:25,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:25,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:25,911 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:25,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:26,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:28,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:28,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-03 16:58:28,788 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:58:28,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:58:28,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:58:28,789 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-12-03 16:58:28,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:28,945 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:58:28,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:58:28,945 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-12-03 16:58:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:28,946 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:58:28,947 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:58:28,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:58:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:58:28,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:58:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:58:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 16:58:28,952 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 16:58:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:28,952 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 16:58:28,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:58:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 16:58:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:58:28,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:28,953 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 16:58:28,953 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:28,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:28,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 16:58:28,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:28,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:28,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:28,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:29,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:29,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:29,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:29,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:29,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:29,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:29,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:29,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:29,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 16:58:29,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:29,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:31,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:32,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:32,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-03 16:58:32,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:32,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:58:32,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:58:32,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:58:32,963 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-12-03 16:58:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:33,148 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 16:58:33,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:58:33,148 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-12-03 16:58:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:33,149 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:58:33,149 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:58:33,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:58:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:58:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:58:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:58:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 16:58:33,153 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 16:58:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:33,154 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 16:58:33,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:58:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 16:58:33,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:58:33,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:33,154 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 16:58:33,154 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:33,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:33,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 16:58:33,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:33,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:33,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:33,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:33,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:34,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:34,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:34,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:34,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:34,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:34,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:34,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:34,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:34,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:34,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:34,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:34,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:37,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:37,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-03 16:58:37,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:37,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:58:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:58:37,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:58:37,202 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-12-03 16:58:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:37,374 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 16:58:37,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:58:37,374 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-12-03 16:58:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:37,375 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:58:37,375 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:58:37,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:58:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:58:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:58:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:58:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 16:58:37,380 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 16:58:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:37,380 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 16:58:37,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:58:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 16:58:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:58:37,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:37,381 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 16:58:37,381 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:37,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:37,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 16:58:37,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:37,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:37,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:38,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:38,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:38,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:38,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:38,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:38,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:38,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:38,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:38,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:39,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:41,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:41,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-03 16:58:41,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:41,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:58:41,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:58:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:58:41,774 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-12-03 16:58:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:41,984 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 16:58:41,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:58:41,984 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-12-03 16:58:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:41,985 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:58:41,986 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:58:41,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:58:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:58:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:58:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:58:41,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 16:58:41,991 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 16:58:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:41,992 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 16:58:41,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:58:41,992 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 16:58:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:58:41,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:41,993 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 16:58:41,993 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:41,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 16:58:41,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:41,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:41,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:41,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:42,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:42,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:42,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:42,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:42,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:42,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:42,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:42,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:43,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 16:58:43,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:43,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:46,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:46,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-03 16:58:46,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:46,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:58:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:58:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:58:46,572 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-12-03 16:58:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:46,774 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 16:58:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:58:46,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-12-03 16:58:46,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:46,776 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:58:46,776 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:58:46,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:58:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:58:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:58:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:58:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 16:58:46,782 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 16:58:46,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:46,782 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 16:58:46,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:58:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 16:58:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:58:46,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:46,783 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 16:58:46,783 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:46,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 16:58:46,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:46,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:46,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:46,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:47,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:47,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:47,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:47,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:47,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:47,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:47,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:47,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:47,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:47,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:47,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:48,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:51,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:51,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-03 16:58:51,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:51,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:58:51,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:58:51,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:58:51,464 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-12-03 16:58:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:51,674 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 16:58:51,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:58:51,675 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-12-03 16:58:51,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:51,676 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:58:51,676 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:58:51,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:58:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:58:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:58:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:58:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 16:58:51,681 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 16:58:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:51,681 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 16:58:51,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:58:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 16:58:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:58:51,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:51,682 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 16:58:51,682 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:51,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 16:58:51,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:51,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:51,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:51,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:51,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:53,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:53,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:53,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:53,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:53,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:53,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:53,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:53,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:53,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:54,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:57,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:57,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-03 16:58:57,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:57,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:58:57,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:58:57,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:58:57,312 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-12-03 16:58:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:57,577 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 16:58:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:58:57,578 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-12-03 16:58:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:57,579 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:58:57,579 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:58:57,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:58:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:58:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:58:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:58:57,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 16:58:57,583 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 16:58:57,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:57,583 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 16:58:57,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:58:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 16:58:57,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:58:57,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:57,584 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 16:58:57,584 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:57,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:57,585 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 16:58:57,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:57,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:58,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:58,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:58,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:58,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:58,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:58,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:58,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:58,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:58,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 16:58:58,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:58,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:00,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:00,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:02,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:02,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:02,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-03 16:59:02,915 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:02,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:59:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:59:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 16:59:02,917 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-12-03 16:59:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:03,124 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 16:59:03,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:59:03,124 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-12-03 16:59:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:03,125 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:59:03,125 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:59:03,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 16:59:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:59:03,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:59:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:59:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 16:59:03,131 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 16:59:03,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:03,131 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 16:59:03,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:59:03,131 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 16:59:03,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:59:03,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:03,132 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 16:59:03,132 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:03,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:03,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 16:59:03,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:03,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:03,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:03,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:03,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:04,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:04,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:04,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:04,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:04,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:04,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:04,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:04,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:04,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:04,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:04,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:04,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:05,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:08,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:08,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-03 16:59:08,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:08,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:59:08,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:59:08,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:59:08,498 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-12-03 16:59:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:08,743 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 16:59:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:59:08,744 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-12-03 16:59:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:08,745 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:59:08,745 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:59:08,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:59:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:59:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:59:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:59:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 16:59:08,750 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 16:59:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:08,751 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 16:59:08,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:59:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 16:59:08,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:59:08,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:08,751 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 16:59:08,751 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:08,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 16:59:08,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:08,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:08,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:08,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:08,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:10,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:10,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:10,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:10,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:10,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:10,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:10,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:10,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:11,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:14,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:14,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:14,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-03 16:59:14,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:14,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:59:14,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:59:14,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:59:14,775 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-12-03 16:59:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:14,999 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 16:59:14,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:59:15,000 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-12-03 16:59:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:15,001 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:59:15,001 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:59:15,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:59:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:59:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:59:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:59:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 16:59:15,007 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 16:59:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:15,008 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 16:59:15,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:59:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 16:59:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:59:15,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:15,009 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 16:59:15,009 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:15,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 16:59:15,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:15,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:16,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:16,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:16,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:16,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:16,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:16,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:16,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:16,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:16,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 16:59:16,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:16,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:18,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:20,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:20,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-03 16:59:20,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:20,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:59:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:59:20,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:59:20,839 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-12-03 16:59:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:21,038 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 16:59:21,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:59:21,038 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-12-03 16:59:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:21,039 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:59:21,039 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:59:21,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:59:21,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:59:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:59:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:59:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 16:59:21,045 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 16:59:21,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:21,045 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 16:59:21,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:59:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 16:59:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:59:21,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:21,046 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 16:59:21,047 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:21,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:21,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 16:59:21,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:21,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:21,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:22,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:22,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:22,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:22,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:22,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:22,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:22,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:22,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:22,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:22,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:22,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:23,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:26,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:26,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-03 16:59:26,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:26,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:59:26,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:59:26,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:59:26,800 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-12-03 16:59:27,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:27,080 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 16:59:27,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:59:27,080 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-12-03 16:59:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:27,081 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:59:27,081 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:59:27,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:59:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:59:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:59:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:59:27,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 16:59:27,085 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 16:59:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:27,086 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 16:59:27,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:59:27,086 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 16:59:27,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:59:27,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:27,086 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 16:59:27,086 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:27,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:27,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 16:59:27,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:27,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:27,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:27,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:28,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:28,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:28,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:28,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:28,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:28,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:28,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:28,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:28,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:31,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:34,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-03 16:59:34,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:34,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:59:34,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:59:34,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:59:34,554 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-12-03 16:59:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:34,791 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 16:59:34,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:59:34,791 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-12-03 16:59:34,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:34,793 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:59:34,793 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:59:34,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:59:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:59:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:59:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:59:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 16:59:34,799 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 16:59:34,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:34,799 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 16:59:34,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:59:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 16:59:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:59:34,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:34,800 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 16:59:34,800 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:34,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 16:59:34,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:34,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:36,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:36,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:36,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:36,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:36,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:36,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:36,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:36,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:36,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 16:59:36,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:36,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:37,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:40,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:40,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2018-12-03 16:59:40,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:40,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:59:40,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:59:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 16:59:40,972 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-12-03 16:59:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:42,549 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 16:59:42,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:59:42,549 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-12-03 16:59:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:42,550 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:59:42,550 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:59:42,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 16:59:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:59:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:59:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:59:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 16:59:42,557 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 16:59:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:42,557 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 16:59:42,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:59:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 16:59:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:59:42,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:42,558 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 16:59:42,560 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:42,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:42,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 16:59:42,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:42,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:42,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:44,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:44,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:44,227 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:44,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:44,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:44,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:44,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:44,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:44,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:44,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:44,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:49,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 156 [2018-12-03 16:59:49,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:49,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:59:49,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:59:49,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:59:49,328 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-12-03 16:59:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:49,590 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 16:59:49,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:59:49,590 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-12-03 16:59:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:49,591 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:59:49,591 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:59:49,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10712 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:59:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:59:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:59:49,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:59:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 16:59:49,598 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 16:59:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:49,599 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 16:59:49,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:59:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 16:59:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:59:49,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:49,600 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 16:59:49,600 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:49,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:49,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 16:59:49,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:49,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:49,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:50,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:50,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:50,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:50,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:50,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:50,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:50,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:50,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:50,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:52,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:56,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:56,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 159 [2018-12-03 16:59:56,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:56,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:59:56,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:59:56,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 16:59:56,377 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-12-03 16:59:56,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:56,642 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 16:59:56,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:59:56,643 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-12-03 16:59:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:56,644 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:59:56,644 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:59:56,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11130 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 16:59:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:59:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:59:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:59:56,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 16:59:56,650 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 16:59:56,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:56,650 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 16:59:56,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:59:56,650 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 16:59:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 16:59:56,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:56,651 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 16:59:56,651 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:56,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:56,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 16:59:56,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:56,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:58,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:58,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:58,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:58,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:58,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:58,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:58,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:58,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:58,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 16:59:58,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:58,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:03,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 162 [2018-12-03 17:00:03,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:03,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:00:03,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:00:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:00:03,702 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-12-03 17:00:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:03,924 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 17:00:03,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:00:03,925 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-12-03 17:00:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:03,926 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:00:03,926 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:00:03,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11556 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:00:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:00:03,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:00:03,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:00:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 17:00:03,931 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 17:00:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:03,932 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 17:00:03,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:00:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 17:00:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:00:03,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:03,932 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 17:00:03,932 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:03,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:03,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 17:00:03,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:03,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:03,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:05,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:05,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:05,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:05,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:05,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:05,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:05,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:05,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:05,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:05,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:05,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:07,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:11,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 165 [2018-12-03 17:00:11,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:11,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:00:11,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:00:11,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 17:00:11,413 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-12-03 17:00:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:11,887 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 17:00:11,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:00:11,887 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-12-03 17:00:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:11,888 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:00:11,888 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:00:11,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11990 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 17:00:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:00:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:00:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:00:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 17:00:11,896 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 17:00:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:11,896 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 17:00:11,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:00:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 17:00:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:00:11,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:11,897 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 17:00:11,897 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:11,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 17:00:11,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:11,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:11,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:13,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:13,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:13,526 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:13,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:13,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:13,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:13,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:13,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:13,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:15,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 168 [2018-12-03 17:00:19,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:19,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 17:00:19,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 17:00:19,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:00:19,309 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-12-03 17:00:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:19,652 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 17:00:19,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:00:19,652 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-12-03 17:00:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:19,653 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:00:19,653 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:00:19,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12432 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:00:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:00:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 17:00:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:00:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 17:00:19,659 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 17:00:19,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:19,659 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 17:00:19,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 17:00:19,660 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 17:00:19,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 17:00:19,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:19,660 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 17:00:19,660 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:19,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:19,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 17:00:19,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:19,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:19,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:19,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:19,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:21,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:21,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:21,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:21,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:21,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:21,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:21,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:21,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:21,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 17:00:21,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:21,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:22,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:26,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:26,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 171 [2018-12-03 17:00:26,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:26,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 17:00:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 17:00:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 17:00:26,989 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-12-03 17:00:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:27,298 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 17:00:27,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:00:27,299 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-12-03 17:00:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:27,300 INFO L225 Difference]: With dead ends: 119 [2018-12-03 17:00:27,300 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 17:00:27,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 17:00:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 17:00:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 17:00:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 17:00:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 17:00:27,305 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 17:00:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:27,306 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 17:00:27,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 17:00:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 17:00:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 17:00:27,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:27,306 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 17:00:27,306 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:27,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 17:00:27,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:27,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:27,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:29,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:29,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:29,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:29,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:29,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:29,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:29,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:29,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:31,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:35,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:35,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 174 [2018-12-03 17:00:35,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:35,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 17:00:35,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 17:00:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:00:35,322 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-12-03 17:00:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:35,600 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-12-03 17:00:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:00:35,600 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-12-03 17:00:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:35,601 INFO L225 Difference]: With dead ends: 121 [2018-12-03 17:00:35,601 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 17:00:35,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13340 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:00:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 17:00:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 17:00:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 17:00:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 17:00:35,607 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 17:00:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:35,608 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 17:00:35,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 17:00:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 17:00:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 17:00:35,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:35,609 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 17:00:35,609 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:35,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:35,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 17:00:35,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:35,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:35,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:35,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:37,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:37,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:37,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:37,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:37,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:37,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:37,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:37,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:37,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:44,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:44,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 177 [2018-12-03 17:00:44,061 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:44,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 17:00:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 17:00:44,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 17:00:44,064 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-12-03 17:00:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:44,324 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-03 17:00:44,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:00:44,325 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-12-03 17:00:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:44,327 INFO L225 Difference]: With dead ends: 123 [2018-12-03 17:00:44,327 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 17:00:44,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13806 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 17:00:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 17:00:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 17:00:44,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 17:00:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 17:00:44,333 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 17:00:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:44,334 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 17:00:44,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 17:00:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 17:00:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 17:00:44,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:44,335 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 17:00:44,335 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:44,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 17:00:44,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:44,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:44,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:44,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:45,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:45,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:45,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:45,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:45,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:45,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:45,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:45,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:46,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 17:00:46,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:46,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:48,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:52,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 180 [2018-12-03 17:00:52,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:52,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 17:00:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 17:00:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:00:52,484 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-12-03 17:00:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:52,764 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-03 17:00:52,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:00:52,765 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-12-03 17:00:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:52,766 INFO L225 Difference]: With dead ends: 125 [2018-12-03 17:00:52,766 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 17:00:52,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:00:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 17:00:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 17:00:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 17:00:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 17:00:52,771 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 17:00:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:52,772 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 17:00:52,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 17:00:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 17:00:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 17:00:52,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:52,773 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 17:00:52,773 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:52,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 17:00:52,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:52,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:52,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:54,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:54,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:54,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:54,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:54,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:54,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:54,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:54,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:54,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:54,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:54,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:54,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:56,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:01,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:01,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 183 [2018-12-03 17:01:01,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:01,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 17:01:01,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 17:01:01,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 17:01:01,419 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-12-03 17:01:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:01,691 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-12-03 17:01:01,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:01:01,691 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-12-03 17:01:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:01,693 INFO L225 Difference]: With dead ends: 127 [2018-12-03 17:01:01,693 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 17:01:01,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14762 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 17:01:01,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 17:01:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 17:01:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 17:01:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 17:01:01,698 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 17:01:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:01,698 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 17:01:01,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 17:01:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 17:01:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 17:01:01,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:01,698 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 17:01:01,699 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:01,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:01,699 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 17:01:01,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:01,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:01,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:01,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:01,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:03,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:03,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:03,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:03,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:03,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:05,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:10,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:10,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 186 [2018-12-03 17:01:10,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:10,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 17:01:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 17:01:10,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:01:10,609 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-12-03 17:01:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:10,886 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-03 17:01:10,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:01:10,886 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-12-03 17:01:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:10,887 INFO L225 Difference]: With dead ends: 129 [2018-12-03 17:01:10,887 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 17:01:10,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15252 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:01:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 17:01:10,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 17:01:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 17:01:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 17:01:10,891 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 17:01:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:10,892 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 17:01:10,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 17:01:10,892 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 17:01:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 17:01:10,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:10,892 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 17:01:10,892 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:10,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 17:01:10,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:10,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:10,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:10,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:10,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:13,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:13,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:13,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:13,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:13,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:13,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:13,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:13,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:13,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 17:01:13,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:13,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:16,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:21,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:21,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 189 [2018-12-03 17:01:21,205 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:21,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 17:01:21,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 17:01:21,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 17:01:21,208 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-12-03 17:01:21,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:21,518 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-12-03 17:01:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:01:21,519 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-12-03 17:01:21,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:21,520 INFO L225 Difference]: With dead ends: 131 [2018-12-03 17:01:21,520 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 17:01:21,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15750 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 17:01:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 17:01:21,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 17:01:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 17:01:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 17:01:21,524 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 17:01:21,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:21,524 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 17:01:21,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 17:01:21,525 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 17:01:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 17:01:21,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:21,526 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 17:01:21,526 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:21,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 17:01:21,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:21,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:21,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:21,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:21,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:23,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:23,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:23,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:23,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:23,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:23,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:23,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:23,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:23,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:23,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:23,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:25,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:30,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:30,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 192 [2018-12-03 17:01:30,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:30,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 17:01:30,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 17:01:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:01:30,929 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-12-03 17:01:31,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:31,266 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-12-03 17:01:31,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:01:31,266 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-12-03 17:01:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:31,267 INFO L225 Difference]: With dead ends: 133 [2018-12-03 17:01:31,267 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 17:01:31,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16256 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:01:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 17:01:31,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 17:01:31,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 17:01:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 17:01:31,272 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 17:01:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:31,273 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 17:01:31,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 17:01:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 17:01:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 17:01:31,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:31,274 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 17:01:31,274 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:31,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:31,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 17:01:31,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:31,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:31,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:31,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:31,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:33,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:33,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:33,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:33,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:33,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:33,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:33,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:33,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:33,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:36,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:41,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:41,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:41,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 195 [2018-12-03 17:01:41,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:41,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 17:01:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 17:01:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 17:01:41,736 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-12-03 17:01:42,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:42,019 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-03 17:01:42,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:01:42,019 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-12-03 17:01:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:42,020 INFO L225 Difference]: With dead ends: 135 [2018-12-03 17:01:42,020 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 17:01:42,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16770 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 17:01:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 17:01:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 17:01:42,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 17:01:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 17:01:42,025 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 17:01:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:42,026 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 17:01:42,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 17:01:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 17:01:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 17:01:42,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:42,027 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 17:01:42,027 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:42,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:42,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 17:01:42,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:42,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:42,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:42,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:42,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:44,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:44,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:44,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:44,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:44,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:44,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:44,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:44,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 17:01:44,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:44,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:46,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:52,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:52,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 198 [2018-12-03 17:01:52,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:52,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 17:01:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 17:01:52,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:01:52,663 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-12-03 17:01:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:52,984 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-12-03 17:01:52,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:01:52,985 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-12-03 17:01:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:52,986 INFO L225 Difference]: With dead ends: 137 [2018-12-03 17:01:52,986 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 17:01:52,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17292 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:01:52,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 17:01:52,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 17:01:52,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 17:01:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 17:01:52,992 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 17:01:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:52,992 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 17:01:52,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 17:01:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 17:01:52,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 17:01:52,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:52,993 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 17:01:52,993 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:52,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 17:01:52,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:52,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:52,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:52,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:55,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:55,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:55,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:55,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:55,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:55,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:55,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:55,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:55,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:55,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:55,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:57,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:03,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:03,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 201 [2018-12-03 17:02:03,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:03,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 17:02:03,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 17:02:03,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 17:02:03,464 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-12-03 17:02:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:03,842 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-12-03 17:02:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:02:03,842 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-12-03 17:02:03,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:03,843 INFO L225 Difference]: With dead ends: 139 [2018-12-03 17:02:03,843 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 17:02:03,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17822 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 17:02:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 17:02:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 17:02:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 17:02:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-12-03 17:02:03,850 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-12-03 17:02:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:03,850 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-12-03 17:02:03,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 17:02:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-12-03 17:02:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 17:02:03,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:03,851 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-12-03 17:02:03,851 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:03,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-12-03 17:02:03,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:03,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:03,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:03,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:03,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:06,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:06,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:06,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:06,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:06,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:06,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:06,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:08,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:14,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:14,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 204 [2018-12-03 17:02:14,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:14,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 17:02:14,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 17:02:14,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:02:14,351 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-12-03 17:02:14,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:14,685 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 17:02:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:02:14,685 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-12-03 17:02:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:14,686 INFO L225 Difference]: With dead ends: 141 [2018-12-03 17:02:14,686 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 17:02:14,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18360 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:02:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 17:02:14,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 17:02:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 17:02:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-12-03 17:02:14,692 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-12-03 17:02:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:14,692 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-12-03 17:02:14,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 17:02:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-12-03 17:02:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 17:02:14,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:14,693 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-12-03 17:02:14,693 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:14,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:14,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-12-03 17:02:14,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:14,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:14,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:17,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:17,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:17,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:17,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:17,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:17,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 17:02:17,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:17,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:19,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:25,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 207 [2018-12-03 17:02:25,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:25,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 17:02:25,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 17:02:25,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 17:02:25,548 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-12-03 17:02:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:25,860 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-12-03 17:02:25,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:02:25,861 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-12-03 17:02:25,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:25,862 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:02:25,862 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 17:02:25,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18906 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 17:02:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 17:02:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 17:02:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 17:02:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-12-03 17:02:25,867 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-12-03 17:02:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:25,867 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-12-03 17:02:25,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 17:02:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-12-03 17:02:25,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 17:02:25,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:25,868 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-12-03 17:02:25,868 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:25,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:25,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-12-03 17:02:25,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:25,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:25,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:25,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:25,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:28,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:28,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:28,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:28,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:28,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:28,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:28,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:28,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:28,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:30,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:37,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 210 [2018-12-03 17:02:37,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:37,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 17:02:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 17:02:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:02:37,212 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-12-03 17:02:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:37,605 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-03 17:02:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:02:37,606 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-12-03 17:02:37,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:37,607 INFO L225 Difference]: With dead ends: 145 [2018-12-03 17:02:37,607 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 17:02:37,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19460 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:02:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 17:02:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 17:02:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 17:02:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-12-03 17:02:37,613 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-12-03 17:02:37,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:37,613 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-12-03 17:02:37,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 17:02:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-12-03 17:02:37,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 17:02:37,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:37,614 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-12-03 17:02:37,614 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:37,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-12-03 17:02:37,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:37,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:37,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:37,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:37,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:39,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:39,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:39,831 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:39,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:39,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:39,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:39,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:39,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:39,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:42,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:49,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:49,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 213 [2018-12-03 17:02:49,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:49,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 17:02:49,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 17:02:49,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 17:02:49,110 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-12-03 17:02:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:49,478 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-03 17:02:49,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:02:49,478 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-12-03 17:02:49,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:49,479 INFO L225 Difference]: With dead ends: 147 [2018-12-03 17:02:49,480 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 17:02:49,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20022 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 17:02:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 17:02:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 17:02:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 17:02:49,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-12-03 17:02:49,487 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-12-03 17:02:49,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:49,487 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-12-03 17:02:49,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 17:02:49,487 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-12-03 17:02:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 17:02:49,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:49,488 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-12-03 17:02:49,488 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:49,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:49,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-12-03 17:02:49,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:49,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:49,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:49,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:49,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:52,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:52,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:52,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:52,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:52,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:52,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:52,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:52,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:52,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 17:02:52,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:52,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:55,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:01,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:01,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 216 [2018-12-03 17:03:01,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:01,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 17:03:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 17:03:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:03:01,680 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-12-03 17:03:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:02,161 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-12-03 17:03:02,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:03:02,162 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-12-03 17:03:02,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:02,166 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:03:02,166 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 17:03:02,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20592 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:03:02,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 17:03:02,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 17:03:02,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 17:03:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-12-03 17:03:02,172 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-12-03 17:03:02,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:02,172 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-12-03 17:03:02,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 17:03:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-12-03 17:03:02,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 17:03:02,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:02,174 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-12-03 17:03:02,174 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:02,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-12-03 17:03:02,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:02,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:02,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:02,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:04,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:04,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:04,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:04,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:04,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:04,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:04,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:04,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:04,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:04,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:04,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:07,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:14,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:14,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 219 [2018-12-03 17:03:14,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:14,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-03 17:03:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-03 17:03:14,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 17:03:14,345 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-12-03 17:03:14,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:14,738 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-12-03 17:03:14,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:03:14,739 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-12-03 17:03:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:14,740 INFO L225 Difference]: With dead ends: 151 [2018-12-03 17:03:14,740 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 17:03:14,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21170 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 17:03:14,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 17:03:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 17:03:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 17:03:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-12-03 17:03:14,747 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-12-03 17:03:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:14,748 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-12-03 17:03:14,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-03 17:03:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-12-03 17:03:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 17:03:14,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:14,749 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-12-03 17:03:14,749 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:14,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:14,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-12-03 17:03:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:17,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:17,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:17,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:17,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:17,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:17,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:17,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:17,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:17,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:20,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:26,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:26,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:26,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 222 [2018-12-03 17:03:26,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:26,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 17:03:26,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 17:03:26,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:03:26,959 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-12-03 17:03:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:27,398 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-03 17:03:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:03:27,399 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-12-03 17:03:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:27,400 INFO L225 Difference]: With dead ends: 153 [2018-12-03 17:03:27,400 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 17:03:27,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21756 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:03:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 17:03:27,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 17:03:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 17:03:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-12-03 17:03:27,406 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-12-03 17:03:27,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:27,406 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-12-03 17:03:27,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 17:03:27,406 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-12-03 17:03:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 17:03:27,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:27,407 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-12-03 17:03:27,408 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:27,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:27,408 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-12-03 17:03:27,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:27,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:27,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:29,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:29,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:29,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:29,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:29,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:29,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:29,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:30,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 17:03:30,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:30,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:33,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:40,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:40,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 225 [2018-12-03 17:03:40,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:40,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-03 17:03:40,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-03 17:03:40,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 17:03:40,252 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-12-03 17:03:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:40,661 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-03 17:03:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:03:40,661 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-12-03 17:03:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:40,662 INFO L225 Difference]: With dead ends: 155 [2018-12-03 17:03:40,662 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 17:03:40,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22350 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 17:03:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 17:03:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 17:03:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 17:03:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-12-03 17:03:40,669 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-12-03 17:03:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:40,669 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-12-03 17:03:40,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-03 17:03:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-12-03 17:03:40,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 17:03:40,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:40,670 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-12-03 17:03:40,670 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:40,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:40,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-12-03 17:03:40,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:40,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:40,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:40,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:43,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:43,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:43,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:43,411 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:43,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:43,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:43,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-12-03 17:03:43,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:43,427 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:43,468 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:43,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:43,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:46,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:53,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:53,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 228 [2018-12-03 17:03:53,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:53,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 17:03:53,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 17:03:53,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 17:03:53,871 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-12-03 17:03:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:54,319 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-12-03 17:03:54,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:03:54,320 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-12-03 17:03:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:54,321 INFO L225 Difference]: With dead ends: 157 [2018-12-03 17:03:54,321 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 17:03:54,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22952 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 17:03:54,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 17:03:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 17:03:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 17:03:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-12-03 17:03:54,326 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-12-03 17:03:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:54,326 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-12-03 17:03:54,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 17:03:54,326 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-12-03 17:03:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 17:03:54,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:54,327 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-12-03 17:03:54,327 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:54,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-12-03 17:03:54,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:54,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:54,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:54,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:54,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:56,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:56,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:56,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:56,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:56,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:56,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:56,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:56,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:00,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:07,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 231 [2018-12-03 17:04:07,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:07,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-03 17:04:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-03 17:04:07,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 17:04:07,458 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-12-03 17:04:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:07,821 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-03 17:04:07,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:04:07,821 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-12-03 17:04:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:07,823 INFO L225 Difference]: With dead ends: 159 [2018-12-03 17:04:07,823 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 17:04:07,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23562 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 17:04:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 17:04:07,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 17:04:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 17:04:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-12-03 17:04:07,829 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-12-03 17:04:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:07,829 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-12-03 17:04:07,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-03 17:04:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-12-03 17:04:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 17:04:07,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:07,830 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-12-03 17:04:07,830 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:07,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:07,831 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-12-03 17:04:07,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:07,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:07,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:10,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:10,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:10,633 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:10,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:10,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:10,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:10,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:10,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:10,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 17:04:10,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:10,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:14,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:21,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:21,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 234 [2018-12-03 17:04:21,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:21,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 17:04:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 17:04:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 17:04:21,529 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-12-03 17:04:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:21,949 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-12-03 17:04:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:04:21,950 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-12-03 17:04:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:21,951 INFO L225 Difference]: With dead ends: 161 [2018-12-03 17:04:21,951 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 17:04:21,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24180 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 17:04:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 17:04:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 17:04:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 17:04:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-12-03 17:04:21,959 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-12-03 17:04:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:21,959 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-12-03 17:04:21,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 17:04:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-12-03 17:04:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 17:04:21,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:21,960 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-12-03 17:04:21,960 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:21,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-12-03 17:04:21,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:21,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:21,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:24,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:24,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:24,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:24,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:24,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:24,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:24,869 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:24,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:24,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:24,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:24,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:28,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:35,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:35,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 237 [2018-12-03 17:04:35,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:35,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-03 17:04:35,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-03 17:04:35,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 17:04:35,862 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-12-03 17:04:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:36,296 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-12-03 17:04:36,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:04:36,297 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-12-03 17:04:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:36,298 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:04:36,298 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 17:04:36,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24806 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 17:04:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 17:04:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 17:04:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 17:04:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-12-03 17:04:36,305 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-12-03 17:04:36,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:36,305 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-12-03 17:04:36,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-03 17:04:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-12-03 17:04:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 17:04:36,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:36,306 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-12-03 17:04:36,307 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:36,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:36,307 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-12-03 17:04:36,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:36,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:36,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:36,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:39,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:39,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:39,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:39,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:39,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:39,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:39,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:39,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:39,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:42,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:50,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:50,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 240 [2018-12-03 17:04:50,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:50,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 17:04:50,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 17:04:50,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 17:04:50,223 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-12-03 17:04:50,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:50,620 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-03 17:04:50,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:04:50,620 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-12-03 17:04:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:50,621 INFO L225 Difference]: With dead ends: 165 [2018-12-03 17:04:50,621 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 17:04:50,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25440 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 17:04:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 17:04:50,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 17:04:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 17:04:50,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-12-03 17:04:50,629 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-12-03 17:04:50,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:50,629 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-12-03 17:04:50,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 17:04:50,629 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-12-03 17:04:50,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 17:04:50,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:50,630 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-12-03 17:04:50,630 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:50,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:50,631 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-12-03 17:04:50,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:50,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:50,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:50,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:53,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:53,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:53,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:53,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:53,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:53,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:53,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:53,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:53,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 17:04:53,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:53,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:57,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:04,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:04,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 243 [2018-12-03 17:05:04,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:04,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-03 17:05:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-03 17:05:04,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 17:05:04,969 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-12-03 17:05:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:05,384 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-12-03 17:05:05,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:05:05,384 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-12-03 17:05:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:05,385 INFO L225 Difference]: With dead ends: 167 [2018-12-03 17:05:05,385 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 17:05:05,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26082 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 17:05:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 17:05:05,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 17:05:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 17:05:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-03 17:05:05,391 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-12-03 17:05:05,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:05,391 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-03 17:05:05,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-03 17:05:05,391 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-03 17:05:05,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 17:05:05,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:05,392 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-12-03 17:05:05,392 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:05,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:05,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-12-03 17:05:05,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:05,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:05,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:05,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:05,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:08,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:08,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:08,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:08,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:08,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:08,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:08,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:08,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:08,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:08,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:08,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:11,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:19,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:19,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 246 [2018-12-03 17:05:19,593 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:19,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 17:05:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 17:05:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 17:05:19,597 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-12-03 17:05:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:20,059 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-12-03 17:05:20,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:05:20,059 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-12-03 17:05:20,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:20,060 INFO L225 Difference]: With dead ends: 169 [2018-12-03 17:05:20,060 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 17:05:20,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26732 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 17:05:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 17:05:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 17:05:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 17:05:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-12-03 17:05:20,066 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-12-03 17:05:20,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:20,066 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-12-03 17:05:20,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 17:05:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-12-03 17:05:20,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 17:05:20,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:20,067 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-12-03 17:05:20,067 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:20,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-12-03 17:05:20,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:20,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:20,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:20,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:22,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:22,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:22,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:22,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:22,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:22,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:22,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:22,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:23,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:26,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:34,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:34,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 249 [2018-12-03 17:05:34,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:34,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-03 17:05:34,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-03 17:05:34,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 17:05:34,717 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-12-03 17:05:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:35,442 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-03 17:05:35,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:05:35,442 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-12-03 17:05:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:35,443 INFO L225 Difference]: With dead ends: 171 [2018-12-03 17:05:35,443 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 17:05:35,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27390 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 17:05:35,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 17:05:35,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 17:05:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 17:05:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-12-03 17:05:35,448 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-12-03 17:05:35,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:35,448 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-12-03 17:05:35,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-03 17:05:35,448 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-12-03 17:05:35,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 17:05:35,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:35,449 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-12-03 17:05:35,449 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:35,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:35,450 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-12-03 17:05:35,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:35,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:35,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:35,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:38,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:38,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:38,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:38,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:38,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:38,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:38,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:38,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 17:05:38,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:38,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:42,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:50,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:50,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 252 [2018-12-03 17:05:50,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:50,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 17:05:50,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 17:05:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 17:05:50,387 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-12-03 17:05:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:50,836 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-12-03 17:05:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:05:50,837 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-12-03 17:05:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:50,838 INFO L225 Difference]: With dead ends: 173 [2018-12-03 17:05:50,838 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 17:05:50,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28056 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 17:05:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 17:05:50,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 17:05:50,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 17:05:50,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-12-03 17:05:50,844 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-12-03 17:05:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:50,844 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-12-03 17:05:50,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 17:05:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-12-03 17:05:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 17:05:50,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:50,845 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-12-03 17:05:50,845 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:50,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:50,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-12-03 17:05:50,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:50,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:50,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:50,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:53,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:53,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:53,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:53,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:53,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:53,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:53,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:53,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:53,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:53,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:53,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:57,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:06,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:06,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 255 [2018-12-03 17:06:06,024 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:06,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-03 17:06:06,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-03 17:06:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 17:06:06,028 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-12-03 17:06:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:06,499 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-03 17:06:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:06:06,500 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-12-03 17:06:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:06,500 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:06:06,501 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 17:06:06,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28730 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 17:06:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 17:06:06,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 17:06:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 17:06:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-12-03 17:06:06,508 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-12-03 17:06:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:06,508 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-12-03 17:06:06,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-03 17:06:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-12-03 17:06:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 17:06:06,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:06,510 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-12-03 17:06:06,512 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:06,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-12-03 17:06:06,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:06,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:06,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:09,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:09,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:09,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:09,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:09,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:09,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:09,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:09,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:09,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:09,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:13,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:22,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:22,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 258 [2018-12-03 17:06:22,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:22,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 17:06:22,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 17:06:22,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 17:06:22,096 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-12-03 17:06:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:22,536 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-03 17:06:22,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:06:22,536 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-12-03 17:06:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:22,537 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:06:22,537 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 17:06:22,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29412 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 17:06:22,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 17:06:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 17:06:22,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 17:06:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-12-03 17:06:22,545 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-12-03 17:06:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:22,545 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-12-03 17:06:22,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 17:06:22,545 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-12-03 17:06:22,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 17:06:22,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:22,546 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-12-03 17:06:22,546 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:22,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-12-03 17:06:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:22,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:22,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:22,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:22,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:25,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:25,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:25,659 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:25,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:25,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:25,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:25,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:25,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 17:06:25,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:25,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:29,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:38,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:38,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 261 [2018-12-03 17:06:38,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:38,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-03 17:06:38,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-03 17:06:38,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 17:06:38,580 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-12-03 17:06:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:39,062 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-12-03 17:06:39,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:06:39,063 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-12-03 17:06:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:39,063 INFO L225 Difference]: With dead ends: 179 [2018-12-03 17:06:39,064 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 17:06:39,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30102 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 17:06:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 17:06:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 17:06:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 17:06:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-12-03 17:06:39,069 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-12-03 17:06:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:39,069 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-12-03 17:06:39,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-03 17:06:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-12-03 17:06:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 17:06:39,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:39,070 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-12-03 17:06:39,070 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:39,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:39,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-12-03 17:06:39,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:39,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:39,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:39,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:39,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:42,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:42,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:42,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:42,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:42,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:42,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:42,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:42,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:42,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:42,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:42,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:46,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:55,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:55,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 264 [2018-12-03 17:06:55,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:55,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-03 17:06:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-03 17:06:55,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 17:06:55,448 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-12-03 17:06:55,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:55,928 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-12-03 17:06:55,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:06:55,928 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-12-03 17:06:55,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:55,929 INFO L225 Difference]: With dead ends: 181 [2018-12-03 17:06:55,930 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 17:06:55,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30800 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 17:06:55,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 17:06:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 17:06:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 17:06:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-12-03 17:06:55,935 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-12-03 17:06:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:55,935 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-12-03 17:06:55,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-03 17:06:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-12-03 17:06:55,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 17:06:55,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:55,936 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-12-03 17:06:55,936 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:55,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-12-03 17:06:55,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:55,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:55,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:55,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:59,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:59,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:59,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:59,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:59,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:59,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:59,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:59,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:59,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:03,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:12,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:12,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 267 [2018-12-03 17:07:12,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:12,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-03 17:07:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-03 17:07:12,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 17:07:12,536 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-12-03 17:07:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:13,090 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-03 17:07:13,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:07:13,091 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-12-03 17:07:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:13,091 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:07:13,091 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 17:07:13,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31506 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 17:07:13,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 17:07:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 17:07:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 17:07:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-12-03 17:07:13,097 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-12-03 17:07:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:13,097 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-12-03 17:07:13,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-03 17:07:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-12-03 17:07:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 17:07:13,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:13,098 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-12-03 17:07:13,098 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:13,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-12-03 17:07:13,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:13,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:16,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:16,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:16,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:16,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:16,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:16,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:16,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:16,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:16,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 17:07:16,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:16,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:20,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:30,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:30,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 270 [2018-12-03 17:07:30,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 17:07:30,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 17:07:30,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 17:07:30,028 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-12-03 17:07:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:30,494 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-03 17:07:30,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:07:30,494 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-12-03 17:07:30,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:30,495 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:07:30,495 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 17:07:30,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32220 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 17:07:30,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 17:07:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 17:07:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 17:07:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-12-03 17:07:30,501 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-12-03 17:07:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:30,502 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-12-03 17:07:30,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 17:07:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-12-03 17:07:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 17:07:30,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:30,502 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-12-03 17:07:30,503 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:30,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:30,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-12-03 17:07:30,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:30,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:30,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:30,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:30,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:33,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:33,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:33,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:33,939 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:33,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:33,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:33,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:33,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:33,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:34,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:34,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:34,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:38,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:47,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:47,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 273 [2018-12-03 17:07:47,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:47,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-03 17:07:47,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-03 17:07:47,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 17:07:47,775 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-12-03 17:07:48,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:48,298 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-12-03 17:07:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:07:48,299 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-12-03 17:07:48,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:48,299 INFO L225 Difference]: With dead ends: 187 [2018-12-03 17:07:48,299 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 17:07:48,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32942 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 17:07:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 17:07:48,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 17:07:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 17:07:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-12-03 17:07:48,307 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-12-03 17:07:48,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:48,307 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-12-03 17:07:48,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-03 17:07:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-12-03 17:07:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 17:07:48,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:48,308 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-12-03 17:07:48,309 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:48,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:48,309 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-12-03 17:07:48,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:48,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:48,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:51,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:51,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:51,891 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:51,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:51,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:51,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:51,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:51,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:51,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:56,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:06,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:06,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 276 [2018-12-03 17:08:06,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:06,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 17:08:06,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 17:08:06,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 17:08:06,033 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2018-12-03 17:08:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:06,502 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-03 17:08:06,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:08:06,502 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 185 [2018-12-03 17:08:06,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:06,503 INFO L225 Difference]: With dead ends: 189 [2018-12-03 17:08:06,503 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 17:08:06,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33672 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 17:08:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 17:08:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 17:08:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 17:08:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-12-03 17:08:06,510 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-12-03 17:08:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:06,511 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-12-03 17:08:06,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 17:08:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-12-03 17:08:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 17:08:06,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:06,512 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-12-03 17:08:06,512 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:06,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-12-03 17:08:06,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:06,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:06,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:10,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:10,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:10,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:10,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:10,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:10,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:08:10,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:08:10,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 17:08:10,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:10,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:14,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:24,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:24,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 279 [2018-12-03 17:08:24,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:24,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-03 17:08:24,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-03 17:08:24,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 17:08:24,650 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 188 states. [2018-12-03 17:08:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:25,258 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-12-03 17:08:25,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:08:25,258 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 187 [2018-12-03 17:08:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:25,259 INFO L225 Difference]: With dead ends: 191 [2018-12-03 17:08:25,259 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 17:08:25,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34410 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 17:08:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 17:08:25,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 17:08:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 17:08:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-12-03 17:08:25,264 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-12-03 17:08:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:25,265 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-12-03 17:08:25,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-03 17:08:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-12-03 17:08:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 17:08:25,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:25,266 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-12-03 17:08:25,266 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:25,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:25,266 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-12-03 17:08:25,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:25,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:25,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:25,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:28,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:28,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:28,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:28,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:28,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:28,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:28,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:08:28,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:08:28,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:08:28,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:28,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:33,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:43,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:43,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 282 [2018-12-03 17:08:43,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:43,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-03 17:08:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-03 17:08:43,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 17:08:43,362 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 190 states. [2018-12-03 17:08:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:43,885 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-12-03 17:08:43,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:08:43,886 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 189 [2018-12-03 17:08:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:43,887 INFO L225 Difference]: With dead ends: 193 [2018-12-03 17:08:43,887 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 17:08:43,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35156 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 17:08:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 17:08:43,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-03 17:08:43,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 17:08:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-12-03 17:08:43,893 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-12-03 17:08:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:43,894 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-12-03 17:08:43,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-03 17:08:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-12-03 17:08:43,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 17:08:43,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:43,894 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-12-03 17:08:43,895 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:43,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-12-03 17:08:43,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:43,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:43,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:43,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:43,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:47,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:47,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:47,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:47,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:47,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:47,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:47,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:47,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:08:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:47,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:52,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:02,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:02,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 285 [2018-12-03 17:09:02,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:02,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 17:09:02,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 17:09:02,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 17:09:02,554 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 192 states. [2018-12-03 17:09:03,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:03,049 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-03 17:09:03,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:09:03,049 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 191 [2018-12-03 17:09:03,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:03,050 INFO L225 Difference]: With dead ends: 195 [2018-12-03 17:09:03,051 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 17:09:03,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35910 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 17:09:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 17:09:03,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-12-03 17:09:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 17:09:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-12-03 17:09:03,057 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-12-03 17:09:03,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:03,057 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-12-03 17:09:03,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 17:09:03,057 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-12-03 17:09:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 17:09:03,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:03,058 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-12-03 17:09:03,058 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:03,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:03,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-12-03 17:09:03,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:03,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:03,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:03,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:03,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:06,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:06,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:06,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:06,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:06,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:06,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:06,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:06,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:09:06,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:09:06,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 17:09:06,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:06,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:11,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:22,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:22,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 288 [2018-12-03 17:09:22,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:22,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 17:09:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 17:09:22,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 17:09:22,088 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 194 states. [2018-12-03 17:09:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:22,600 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-12-03 17:09:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:09:22,601 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 193 [2018-12-03 17:09:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:22,602 INFO L225 Difference]: With dead ends: 197 [2018-12-03 17:09:22,602 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 17:09:22,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36672 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 17:09:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 17:09:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 17:09:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 17:09:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-03 17:09:22,607 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-12-03 17:09:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:22,607 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-03 17:09:22,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 17:09:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-03 17:09:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 17:09:22,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:22,608 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-12-03 17:09:22,609 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:22,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:22,609 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-12-03 17:09:22,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:22,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:22,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:22,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:22,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:26,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:26,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:26,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:26,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:26,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:26,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:26,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:09:26,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:09:26,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:09:26,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:26,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:31,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:41,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:41,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 291 [2018-12-03 17:09:41,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:41,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-03 17:09:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-03 17:09:41,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 17:09:41,901 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 196 states. [2018-12-03 17:09:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:42,478 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-12-03 17:09:42,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:09:42,478 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 195 [2018-12-03 17:09:42,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:42,479 INFO L225 Difference]: With dead ends: 199 [2018-12-03 17:09:42,479 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 17:09:42,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37442 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 17:09:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 17:09:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 17:09:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 17:09:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-12-03 17:09:42,486 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-12-03 17:09:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:42,486 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-12-03 17:09:42,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-03 17:09:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-12-03 17:09:42,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 17:09:42,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:42,488 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-12-03 17:09:42,488 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:42,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-12-03 17:09:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:42,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:42,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:46,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:46,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:46,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:46,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:46,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:46,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:46,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:46,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:09:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:46,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:51,238 INFO L316 TraceCheckSpWp]: Computing backward predicates...