java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:24:48,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:24:48,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:24:48,326 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:24:48,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:24:48,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:24:48,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:24:48,331 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:24:48,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:24:48,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:24:48,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:24:48,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:24:48,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:24:48,337 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:24:48,338 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:24:48,339 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:24:48,340 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:24:48,342 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:24:48,345 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:24:48,347 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:24:48,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:24:48,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:24:48,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:24:48,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:24:48,356 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:24:48,357 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:24:48,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:24:48,365 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:24:48,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:24:48,367 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:24:48,367 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:24:48,368 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:24:48,368 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:24:48,368 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:24:48,371 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:24:48,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:24:48,372 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-20 10:24:48,397 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:24:48,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:24:48,398 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:24:48,398 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:24:48,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:24:48,399 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:24:48,399 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:24:48,399 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:24:48,400 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:24:48,400 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:24:48,400 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:24:48,400 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:24:48,400 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:24:48,401 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:24:48,401 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:24:48,402 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:24:48,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:24:48,402 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:24:48,402 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:24:48,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:24:48,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:24:48,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:24:48,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:24:48,404 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:24:48,405 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:24:48,405 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:24:48,405 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:24:48,405 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:24:48,405 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:24:48,406 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:24:48,406 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:24:48,406 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:24:48,406 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:24:48,406 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:24:48,407 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:24:48,407 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:24:48,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:24:48,407 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:24:48,407 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:24:48,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:24:48,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:24:48,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:24:48,501 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:24:48,502 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:24:48,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-20 10:24:48,504 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-20 10:24:48,555 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:24:48,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:24:48,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:24:48,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:24:48,558 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:24:48,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:24:48,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:24:48,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:24:48,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:24:48,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/1) ... [2019-01-20 10:24:48,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:24:48,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:24:48,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:24:48,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:24:48,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (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 [2019-01-20 10:24:48,709 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-20 10:24:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:24:48,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:24:48,988 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:24:48,989 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-20 10:24:48,990 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:24:48 BoogieIcfgContainer [2019-01-20 10:24:48,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:24:48,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:24:48,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:24:48,996 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:24:48,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:24:48" (1/2) ... [2019-01-20 10:24:48,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c94d857 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:24:48, skipping insertion in model container [2019-01-20 10:24:48,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:24:48" (2/2) ... [2019-01-20 10:24:49,000 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-20 10:24:49,011 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:24:49,019 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 10:24:49,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 10:24:49,070 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:24:49,070 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:24:49,070 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:24:49,070 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:24:49,071 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:24:49,071 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:24:49,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:24:49,071 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:24:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-20 10:24:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:24:49,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:49,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:24:49,098 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:49,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-20 10:24:49,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:49,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:49,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:24:49,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:24:49,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:24:49,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:24:49,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:24:49,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:24:49,401 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-20 10:24:49,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:49,575 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-20 10:24:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:24:49,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-20 10:24:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:49,591 INFO L225 Difference]: With dead ends: 26 [2019-01-20 10:24:49,591 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 10:24:49,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:24:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 10:24:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-20 10:24:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:24:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-20 10:24:49,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-20 10:24:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:49,643 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-20 10:24:49,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:24:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-20 10:24:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:24:49,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:49,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:24:49,644 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-20 10:24:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:49,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:49,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:24:49,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-20 10:24:49,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:24:49,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:24:49,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:24:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:24:49,753 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-20 10:24:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:49,843 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-20 10:24:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:24:49,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-20 10:24:49,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:49,845 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:24:49,845 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 10:24:49,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:24:49,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 10:24:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-20 10:24:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:24:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-20 10:24:49,853 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-20 10:24:49,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:49,853 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-20 10:24:49,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:24:49,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-20 10:24:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:24:49,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:49,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:24:49,855 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:49,855 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-20 10:24:49,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:49,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:49,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:24:49,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:24:49,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:24:49,910 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:24:49,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:24:49,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:24:49,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:24:49,912 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-20 10:24:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:49,969 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-20 10:24:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:24:49,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-20 10:24:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:49,970 INFO L225 Difference]: With dead ends: 24 [2019-01-20 10:24:49,970 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 10:24:49,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:24:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 10:24:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-20 10:24:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:24:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-20 10:24:49,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-20 10:24:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:49,978 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-20 10:24:49,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:24:49,978 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-20 10:24:49,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:24:49,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:49,980 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:24:49,980 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:49,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-20 10:24:49,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:49,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:49,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:50,314 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-20 10:24:50,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:50,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:50,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:50,365 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:24:50,368 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-20 10:24:50,438 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:24:50,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:24:50,674 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:24:50,676 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:24:50,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:50,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:24:50,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:50,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:50,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:50,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:50,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:50,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:50,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:50,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-20 10:24:50,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:50,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:24:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:24:50,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:24:50,928 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-20 10:24:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:51,165 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-20 10:24:51,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:24:51,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-20 10:24:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:51,167 INFO L225 Difference]: With dead ends: 26 [2019-01-20 10:24:51,167 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:24:51,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:24:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:24:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-20 10:24:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 10:24:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-20 10:24:51,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-20 10:24:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:51,173 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-20 10:24:51,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:24:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-20 10:24:51,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-20 10:24:51,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:51,174 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:24:51,174 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:51,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-20 10:24:51,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:51,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:51,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:51,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:51,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:51,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:51,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:51,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:51,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-20 10:24:51,268 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-20 10:24:51,270 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:24:51,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:24:51,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:24:51,407 INFO L272 AbstractInterpreter]: Visited 12 different actions 96 times. Merged at 11 different actions 70 times. Widened at 3 different actions 7 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-20 10:24:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:51,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:24:51,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:51,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:51,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:51,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:51,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:51,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:51,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:51,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-20 10:24:51,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:51,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:24:51,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:24:51,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:24:51,622 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-20 10:24:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:52,046 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-20 10:24:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:24:52,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-20 10:24:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:52,047 INFO L225 Difference]: With dead ends: 31 [2019-01-20 10:24:52,047 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:24:52,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:24:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:24:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-20 10:24:52,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:24:52,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-20 10:24:52,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-20 10:24:52,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:52,053 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-20 10:24:52,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:24:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-20 10:24:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 10:24:52,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:52,054 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:24:52,054 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:52,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-20 10:24:52,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:52,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:52,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:52,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:52,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:52,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:52,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:52,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:52,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:52,398 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:52,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:52,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:24:52,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:52,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:52,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:52,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:52,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-20 10:24:52,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:52,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:24:52,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:24:52,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:24:52,598 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-20 10:24:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:52,904 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-20 10:24:52,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:24:52,905 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-20 10:24:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:52,906 INFO L225 Difference]: With dead ends: 35 [2019-01-20 10:24:52,906 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:24:52,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:24:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:24:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-20 10:24:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:24:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-20 10:24:52,912 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-20 10:24:52,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:52,913 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-20 10:24:52,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:24:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-20 10:24:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 10:24:52,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:52,914 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-20 10:24:52,914 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:52,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:52,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-20 10:24:52,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:52,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:52,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:52,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:53,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:53,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:53,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:53,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:53,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:53,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:53,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:53,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:53,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:53,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:53,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-20 10:24:53,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:53,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:24:53,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:24:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:24:53,255 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-20 10:24:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:53,370 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-20 10:24:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:24:53,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-20 10:24:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:53,371 INFO L225 Difference]: With dead ends: 45 [2019-01-20 10:24:53,371 INFO L226 Difference]: Without dead ends: 26 [2019-01-20 10:24:53,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:24:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-20 10:24:53,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-20 10:24:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:24:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-20 10:24:53,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-20 10:24:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:53,377 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-20 10:24:53,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:24:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-20 10:24:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 10:24:53,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:53,378 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-20 10:24:53,379 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:53,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:53,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-20 10:24:53,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:53,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:53,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:53,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:53,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:53,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:53,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:53,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:53,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:53,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:53,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:53,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-20 10:24:53,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:53,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:24:53,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:24:53,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:24:53,857 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-20 10:24:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:54,270 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-20 10:24:54,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 10:24:54,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-20 10:24:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:54,272 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:24:54,272 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 10:24:54,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:24:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 10:24:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-20 10:24:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 10:24:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-20 10:24:54,279 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-20 10:24:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:54,280 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-20 10:24:54,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:24:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-20 10:24:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 10:24:54,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:54,281 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-20 10:24:54,282 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:54,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-20 10:24:54,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:54,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:54,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:54,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:54,395 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:54,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:54,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:54,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:54,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:54,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:54,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:54,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:54,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:54,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:24:54,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:54,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:54,516 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:54,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:54,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:54,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-20 10:24:54,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:54,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:24:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:24:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:24:54,608 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-20 10:24:54,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:54,946 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-20 10:24:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:24:54,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-20 10:24:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:54,947 INFO L225 Difference]: With dead ends: 60 [2019-01-20 10:24:54,948 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 10:24:54,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:24:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 10:24:54,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-20 10:24:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:24:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-20 10:24:54,955 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-20 10:24:54,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:54,955 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-20 10:24:54,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:24:54,955 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-20 10:24:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 10:24:54,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:54,956 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-20 10:24:54,956 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:54,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:54,956 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-20 10:24:54,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:54,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:54,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:54,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:55,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:55,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:55,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:55,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:55,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:55,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:55,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:55,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:55,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:55,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:55,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:55,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:55,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:55,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-20 10:24:55,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:55,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 10:24:55,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 10:24:55,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:24:55,424 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-20 10:24:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:56,162 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-20 10:24:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 10:24:56,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-20 10:24:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:56,169 INFO L225 Difference]: With dead ends: 64 [2019-01-20 10:24:56,169 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 10:24:56,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-20 10:24:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 10:24:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-20 10:24:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:24:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-20 10:24:56,177 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-20 10:24:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:56,177 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-20 10:24:56,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 10:24:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-20 10:24:56,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 10:24:56,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:56,179 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-20 10:24:56,179 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-20 10:24:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:56,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:56,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:56,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:56,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:56,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:56,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:56,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:56,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:56,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:56,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:56,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:56,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:56,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:57,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:57,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-20 10:24:57,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:57,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 10:24:57,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 10:24:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:24:57,070 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-20 10:24:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:57,402 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-20 10:24:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:24:57,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-20 10:24:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:57,403 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:24:57,404 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 10:24:57,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:24:57,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 10:24:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-20 10:24:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:24:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-20 10:24:57,411 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-20 10:24:57,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:57,411 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-20 10:24:57,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 10:24:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-20 10:24:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-20 10:24:57,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:57,413 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-20 10:24:57,413 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:57,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:57,413 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-20 10:24:57,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:57,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:57,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:57,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:57,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:57,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:57,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:57,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:57,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:57,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:57,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:24:57,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:57,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:57,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 10:24:57,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:57,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:58,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:24:59,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:59,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-20 10:24:59,135 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:59,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 10:24:59,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 10:24:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:24:59,137 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-20 10:25:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:01,205 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-20 10:25:01,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 10:25:01,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-20 10:25:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:01,206 INFO L225 Difference]: With dead ends: 97 [2019-01-20 10:25:01,206 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:25:01,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 10:25:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:25:01,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-20 10:25:01,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 10:25:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-20 10:25:01,217 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-20 10:25:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:01,217 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-20 10:25:01,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 10:25:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-20 10:25:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 10:25:01,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:01,219 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-20 10:25:01,219 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:01,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-20 10:25:01,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:01,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:01,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:01,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:01,648 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:01,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:01,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:01,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:01,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:01,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:01,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:01,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:01,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:01,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:01,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:01,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:01,961 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:01,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:02,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:02,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-20 10:25:02,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:02,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 10:25:02,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 10:25:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:25:02,022 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-20 10:25:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:03,411 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-20 10:25:03,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 10:25:03,412 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-20 10:25:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:03,413 INFO L225 Difference]: With dead ends: 94 [2019-01-20 10:25:03,413 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:25:03,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 10:25:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:25:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-20 10:25:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 10:25:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-20 10:25:03,424 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-20 10:25:03,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:03,424 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-20 10:25:03,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 10:25:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-20 10:25:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 10:25:03,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:03,425 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-20 10:25:03,425 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-20 10:25:03,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:03,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:03,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:03,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:03,597 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:03,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:03,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:03,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:03,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:03,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:03,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:03,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:03,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-20 10:25:03,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:03,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 10:25:03,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 10:25:03,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:25:03,993 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-20 10:25:04,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:04,296 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-20 10:25:04,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 10:25:04,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-20 10:25:04,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:04,298 INFO L225 Difference]: With dead ends: 105 [2019-01-20 10:25:04,298 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 10:25:04,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-20 10:25:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 10:25:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-20 10:25:04,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 10:25:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-20 10:25:04,309 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-20 10:25:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:04,309 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-20 10:25:04,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 10:25:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-20 10:25:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 10:25:04,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:04,310 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-20 10:25:04,311 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:04,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-20 10:25:04,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:04,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:04,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:04,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:04,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:04,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:04,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:04,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:04,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:04,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:04,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:04,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:04,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 10:25:04,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:04,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:05,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:05,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:05,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-20 10:25:05,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:05,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 10:25:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 10:25:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-20 10:25:05,066 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-20 10:25:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:06,494 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-20 10:25:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 10:25:06,495 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-20 10:25:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:06,495 INFO L225 Difference]: With dead ends: 109 [2019-01-20 10:25:06,496 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:25:06,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 10:25:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:25:06,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-20 10:25:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 10:25:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-20 10:25:06,509 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-20 10:25:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:06,510 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-20 10:25:06,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 10:25:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-20 10:25:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 10:25:06,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:06,511 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-20 10:25:06,511 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-20 10:25:06,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:06,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:06,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:06,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:06,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:06,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:06,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:06,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:06,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:06,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:06,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:06,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:06,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:06,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:06,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:06,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:06,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:07,068 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:07,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:07,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-20 10:25:07,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:07,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 10:25:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 10:25:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-20 10:25:07,089 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-20 10:25:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:07,410 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-20 10:25:07,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 10:25:07,411 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-20 10:25:07,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:07,412 INFO L225 Difference]: With dead ends: 120 [2019-01-20 10:25:07,412 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:25:07,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:25:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:25:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-20 10:25:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:25:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-20 10:25:07,424 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-20 10:25:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:07,424 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-20 10:25:07,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 10:25:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-20 10:25:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 10:25:07,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:07,425 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-20 10:25:07,425 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-20 10:25:07,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:07,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:07,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:07,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:08,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:08,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:08,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:08,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:08,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:08,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:08,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:08,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:08,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:08,368 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:08,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:08,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:08,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-20 10:25:08,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:08,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 10:25:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 10:25:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-20 10:25:08,532 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-20 10:25:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:10,084 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-20 10:25:10,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 10:25:10,089 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-20 10:25:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:10,090 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:25:10,090 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 10:25:10,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-20 10:25:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 10:25:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-20 10:25:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 10:25:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-20 10:25:10,101 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-20 10:25:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:10,102 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-20 10:25:10,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 10:25:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-20 10:25:10,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 10:25:10,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:10,103 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-20 10:25:10,103 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:10,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:10,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-20 10:25:10,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:10,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:10,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:10,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:10,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:10,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:10,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:10,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:10,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:10,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:10,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:10,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:10,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:10,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 10:25:10,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:10,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:10,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:10,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:10,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-20 10:25:10,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:10,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 10:25:10,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 10:25:10,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-20 10:25:10,841 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-20 10:25:11,376 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-20 10:25:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:11,428 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-20 10:25:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 10:25:11,429 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-20 10:25:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:11,430 INFO L225 Difference]: With dead ends: 135 [2019-01-20 10:25:11,430 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:25:11,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:25:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:25:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-20 10:25:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 10:25:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-20 10:25:11,449 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-20 10:25:11,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:11,450 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-20 10:25:11,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 10:25:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-20 10:25:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-20 10:25:11,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:11,458 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-20 10:25:11,458 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:11,459 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-20 10:25:11,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:11,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:11,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:11,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:11,910 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:11,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:11,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:11,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:11,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:11,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:11,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:11,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:11,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:11,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:11,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:12,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:12,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:12,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-20 10:25:12,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:12,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 10:25:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 10:25:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:25:12,412 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-20 10:25:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:14,505 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-20 10:25:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 10:25:14,505 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-20 10:25:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:14,507 INFO L225 Difference]: With dead ends: 139 [2019-01-20 10:25:14,507 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:25:14,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:25:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:25:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-20 10:25:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-20 10:25:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-20 10:25:14,517 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-20 10:25:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:14,517 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-20 10:25:14,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 10:25:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-20 10:25:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-20 10:25:14,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:14,518 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-20 10:25:14,518 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:14,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-20 10:25:14,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:14,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:14,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:14,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:14,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:14,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:14,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:14,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:14,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:14,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:14,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:14,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:14,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:14,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:15,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:15,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:15,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-20 10:25:15,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:15,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 10:25:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 10:25:15,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:25:15,647 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-20 10:25:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:16,075 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-20 10:25:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 10:25:16,075 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-20 10:25:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:16,076 INFO L225 Difference]: With dead ends: 150 [2019-01-20 10:25:16,076 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:25:16,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 10:25:16,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:25:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-20 10:25:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:25:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-20 10:25:16,088 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-20 10:25:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:16,088 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-20 10:25:16,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 10:25:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-20 10:25:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:25:16,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:16,089 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-20 10:25:16,090 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:16,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-20 10:25:16,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:16,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:16,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:16,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:16,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:16,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:16,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:16,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:16,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:16,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:16,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:16,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 10:25:16,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:16,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:17,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:18,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:18,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-20 10:25:18,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:18,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:25:18,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:25:18,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 10:25:18,533 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-20 10:25:21,103 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-20 10:25:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:23,242 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-20 10:25:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:25:23,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-20 10:25:23,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:23,243 INFO L225 Difference]: With dead ends: 192 [2019-01-20 10:25:23,244 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:25:23,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 10:25:23,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:25:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-20 10:25:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:25:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-20 10:25:23,259 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-20 10:25:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:23,259 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-20 10:25:23,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:25:23,259 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-20 10:25:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 10:25:23,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:23,260 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-20 10:25:23,260 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:23,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-20 10:25:23,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:23,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:23,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:23,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:23,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:23,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:23,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:23,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:23,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:23,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:23,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:23,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:23,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:23,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:23,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:24,433 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:24,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:24,490 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:24,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:24,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-20 10:25:24,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:24,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 10:25:24,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 10:25:24,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:25:24,513 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-20 10:25:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:26,774 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-20 10:25:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 10:25:26,778 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-20 10:25:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:26,778 INFO L225 Difference]: With dead ends: 169 [2019-01-20 10:25:26,779 INFO L226 Difference]: Without dead ends: 127 [2019-01-20 10:25:26,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 10:25:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-20 10:25:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-20 10:25:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:25:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-20 10:25:26,789 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-20 10:25:26,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:26,789 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-20 10:25:26,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 10:25:26,790 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-20 10:25:26,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 10:25:26,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:26,790 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-20 10:25:26,791 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:26,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-20 10:25:26,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:26,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:26,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:27,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:27,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:27,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:27,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:27,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:27,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:27,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:27,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:27,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:28,443 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:28,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:28,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:28,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-20 10:25:28,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:28,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 10:25:28,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 10:25:28,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:25:28,657 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-20 10:25:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:29,222 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-20 10:25:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 10:25:29,222 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-20 10:25:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:29,224 INFO L225 Difference]: With dead ends: 180 [2019-01-20 10:25:29,224 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:25:29,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:25:29,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:25:29,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-20 10:25:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 10:25:29,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-20 10:25:29,236 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-20 10:25:29,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:29,236 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-20 10:25:29,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 10:25:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-20 10:25:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 10:25:29,237 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:29,238 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-20 10:25:29,238 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:29,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-20 10:25:29,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:29,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:29,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:29,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:29,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:29,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:29,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:29,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:29,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:29,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:29,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:29,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:29,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 10:25:29,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:29,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:31,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:32,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:32,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-20 10:25:32,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:32,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 10:25:32,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 10:25:32,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-20 10:25:32,060 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-20 10:25:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:38,822 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-20 10:25:38,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:25:38,823 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-20 10:25:38,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:38,824 INFO L225 Difference]: With dead ends: 230 [2019-01-20 10:25:38,824 INFO L226 Difference]: Without dead ends: 135 [2019-01-20 10:25:38,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-20 10:25:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-20 10:25:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-20 10:25:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-20 10:25:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-20 10:25:38,843 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-20 10:25:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:38,844 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-20 10:25:38,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 10:25:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-20 10:25:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-20 10:25:38,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:38,845 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-20 10:25:38,845 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:38,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-20 10:25:38,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:38,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:38,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:39,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:39,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:39,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:39,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:39,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:39,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:39,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:39,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:39,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:39,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:39,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:40,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:40,347 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:40,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:40,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-20 10:25:40,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:40,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 10:25:40,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 10:25:40,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:25:40,369 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-20 10:25:43,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:43,782 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-20 10:25:43,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:25:43,782 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-20 10:25:43,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:43,783 INFO L225 Difference]: With dead ends: 199 [2019-01-20 10:25:43,783 INFO L226 Difference]: Without dead ends: 149 [2019-01-20 10:25:43,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:25:43,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-20 10:25:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-20 10:25:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:25:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-20 10:25:43,798 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-20 10:25:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:43,798 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-20 10:25:43,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 10:25:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-20 10:25:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-20 10:25:43,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:43,799 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-20 10:25:43,799 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-20 10:25:43,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:43,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:43,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:43,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:44,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:44,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:44,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:44,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:44,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:44,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:44,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:44,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:44,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:44,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:45,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:45,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-20 10:25:45,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:45,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 10:25:45,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 10:25:45,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:25:45,329 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-20 10:25:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:46,007 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-20 10:25:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 10:25:46,007 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-20 10:25:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:46,008 INFO L225 Difference]: With dead ends: 210 [2019-01-20 10:25:46,008 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:25:46,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:25:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:25:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-20 10:25:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:25:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-20 10:25:46,026 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-20 10:25:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:46,026 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-20 10:25:46,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 10:25:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-20 10:25:46,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:25:46,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:46,027 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-20 10:25:46,027 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:46,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-20 10:25:46,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:46,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:46,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:46,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:46,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:46,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:46,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:46,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:46,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:46,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:46,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 10:25:46,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:46,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:47,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:47,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:47,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-20 10:25:47,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:47,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:25:47,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:25:47,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 10:25:47,546 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-20 10:25:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:51,296 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-20 10:25:51,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:25:51,296 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-20 10:25:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:51,297 INFO L225 Difference]: With dead ends: 214 [2019-01-20 10:25:51,298 INFO L226 Difference]: Without dead ends: 160 [2019-01-20 10:25:51,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-20 10:25:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-20 10:25:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-20 10:25:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:25:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-20 10:25:51,316 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-20 10:25:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:51,317 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-20 10:25:51,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:25:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-20 10:25:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:25:51,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:51,318 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-20 10:25:51,318 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:51,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-20 10:25:51,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:51,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:51,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:51,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:51,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:51,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:51,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:51,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:51,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:51,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:51,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:51,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:51,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:51,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:52,166 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:52,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:52,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:52,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-20 10:25:52,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:52,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:25:52,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:25:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 10:25:52,511 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-20 10:25:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:53,168 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-20 10:25:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 10:25:53,168 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-20 10:25:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:53,169 INFO L225 Difference]: With dead ends: 225 [2019-01-20 10:25:53,170 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 10:25:53,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:25:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 10:25:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-20 10:25:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 10:25:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-20 10:25:53,190 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-20 10:25:53,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:53,191 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-20 10:25:53,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:25:53,191 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-20 10:25:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-20 10:25:53,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:53,192 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-20 10:25:53,192 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-20 10:25:53,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:53,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:53,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:54,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:54,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:54,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:54,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:54,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:54,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:25:54,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:54,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:54,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:54,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:25:54,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:54,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-20 10:25:54,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:54,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 10:25:54,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 10:25:54,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:25:54,996 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-20 10:25:59,850 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-20 10:26:00,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:00,177 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-20 10:26:00,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:26:00,178 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-20 10:26:00,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:00,179 INFO L225 Difference]: With dead ends: 229 [2019-01-20 10:26:00,179 INFO L226 Difference]: Without dead ends: 171 [2019-01-20 10:26:00,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:26:00,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-20 10:26:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-20 10:26:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-20 10:26:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-20 10:26:00,203 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-20 10:26:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:00,204 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-20 10:26:00,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 10:26:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-20 10:26:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-20 10:26:00,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:00,205 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-20 10:26:00,205 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-20 10:26:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:00,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:00,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:00,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:00,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:00,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:00,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:00,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:00,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:00,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:00,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 10:26:00,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:00,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:01,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:01,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:01,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-20 10:26:01,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:01,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 10:26:01,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 10:26:01,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:26:01,557 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-20 10:26:02,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:02,131 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-20 10:26:02,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 10:26:02,132 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-20 10:26:02,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:02,133 INFO L225 Difference]: With dead ends: 240 [2019-01-20 10:26:02,133 INFO L226 Difference]: Without dead ends: 117 [2019-01-20 10:26:02,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 10:26:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-20 10:26:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-20 10:26:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-20 10:26:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-20 10:26:02,155 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-20 10:26:02,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:02,156 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-20 10:26:02,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 10:26:02,156 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-20 10:26:02,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-20 10:26:02,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:02,157 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-20 10:26:02,157 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-20 10:26:02,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:02,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:02,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:03,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:03,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:03,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:03,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:03,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:03,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:03,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:03,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:03,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:03,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:03,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:04,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:04,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:04,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-20 10:26:04,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:04,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:26:04,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:26:04,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 10:26:04,563 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-20 10:26:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:10,010 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-20 10:26:10,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:26:10,010 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-20 10:26:10,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:10,012 INFO L225 Difference]: With dead ends: 244 [2019-01-20 10:26:10,013 INFO L226 Difference]: Without dead ends: 182 [2019-01-20 10:26:10,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-20 10:26:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-20 10:26:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-20 10:26:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-20 10:26:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-20 10:26:10,037 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-20 10:26:10,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:10,037 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-20 10:26:10,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:26:10,037 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-20 10:26:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-20 10:26:10,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:10,038 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-20 10:26:10,038 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:10,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-20 10:26:10,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:10,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:10,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:10,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:10,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:10,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:10,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:10,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:10,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:10,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:10,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:10,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:10,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:11,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:11,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:11,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-20 10:26:11,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:11,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:26:11,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:26:11,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 10:26:11,699 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-20 10:26:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:12,659 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-20 10:26:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 10:26:12,659 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-20 10:26:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:12,661 INFO L225 Difference]: With dead ends: 255 [2019-01-20 10:26:12,661 INFO L226 Difference]: Without dead ends: 124 [2019-01-20 10:26:12,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:26:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-20 10:26:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-20 10:26:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-20 10:26:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-20 10:26:12,680 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-20 10:26:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:12,681 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-20 10:26:12,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:26:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-20 10:26:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-20 10:26:12,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:12,681 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-20 10:26:12,682 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-20 10:26:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:12,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:13,700 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:13,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:13,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:13,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:13,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:13,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:13,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:13,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:13,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:13,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 10:26:13,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:13,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:15,985 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:15,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:17,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:17,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-20 10:26:17,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:17,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 10:26:17,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 10:26:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:26:17,876 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-20 10:26:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:28,803 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-20 10:26:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-20 10:26:28,803 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-20 10:26:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:28,804 INFO L225 Difference]: With dead ends: 325 [2019-01-20 10:26:28,804 INFO L226 Difference]: Without dead ends: 190 [2019-01-20 10:26:28,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:26:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-20 10:26:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-20 10:26:28,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-20 10:26:28,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-20 10:26:28,828 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-20 10:26:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:28,828 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-20 10:26:28,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 10:26:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-20 10:26:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-20 10:26:28,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:28,830 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-20 10:26:28,830 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:28,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:28,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-20 10:26:28,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:28,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:28,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:28,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:30,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:30,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:30,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:30,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:30,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:30,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:30,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:30,128 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:30,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:30,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:31,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:31,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:31,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-20 10:26:31,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:31,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 10:26:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 10:26:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 10:26:31,203 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-20 10:26:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:37,152 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-20 10:26:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:26:37,152 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-20 10:26:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:37,154 INFO L225 Difference]: With dead ends: 274 [2019-01-20 10:26:37,154 INFO L226 Difference]: Without dead ends: 204 [2019-01-20 10:26:37,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:26:37,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-20 10:26:37,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-20 10:26:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 10:26:37,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-20 10:26:37,177 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-20 10:26:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:37,177 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-20 10:26:37,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 10:26:37,177 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-20 10:26:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-20 10:26:37,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:37,178 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-20 10:26:37,178 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:37,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:37,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-20 10:26:37,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:37,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:37,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:37,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:37,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:38,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:38,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:38,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:38,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:38,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:38,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:38,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:38,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:39,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:40,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:40,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-20 10:26:40,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:40,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 10:26:40,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 10:26:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 10:26:40,271 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-20 10:26:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:41,185 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-20 10:26:41,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 10:26:41,186 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-20 10:26:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:41,187 INFO L225 Difference]: With dead ends: 285 [2019-01-20 10:26:41,187 INFO L226 Difference]: Without dead ends: 138 [2019-01-20 10:26:41,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 10:26:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-20 10:26:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-20 10:26:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-20 10:26:41,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-20 10:26:41,215 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-20 10:26:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:41,215 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-20 10:26:41,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 10:26:41,215 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-20 10:26:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-20 10:26:41,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:41,216 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-20 10:26:41,216 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:41,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-20 10:26:41,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:41,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:41,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:41,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:41,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:42,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:42,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:42,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:42,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:42,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:42,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:42,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:26:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:42,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:42,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 10:26:42,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:42,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:45,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:47,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:26:47,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:47,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-20 10:26:47,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:47,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:26:47,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:26:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 10:26:47,536 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-20 10:26:58,824 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-20 10:26:59,127 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-20 10:27:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:01,896 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-20 10:27:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-20 10:27:01,897 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-20 10:27:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:01,899 INFO L225 Difference]: With dead ends: 363 [2019-01-20 10:27:01,899 INFO L226 Difference]: Without dead ends: 212 [2019-01-20 10:27:01,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:27:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-20 10:27:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-20 10:27:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-20 10:27:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-20 10:27:01,932 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-20 10:27:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:01,932 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-20 10:27:01,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:27:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-20 10:27:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-20 10:27:01,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:01,933 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-20 10:27:01,933 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:01,934 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-20 10:27:01,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:01,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:01,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:01,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:03,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:03,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:03,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:03,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:03,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:03,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:03,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:03,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:03,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:03,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:03,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:04,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:04,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:04,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-20 10:27:04,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:04,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:27:04,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:27:04,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 10:27:04,954 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-20 10:27:09,366 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-20 10:27:09,654 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-20 10:27:09,925 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-20 10:27:10,107 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:27:10,490 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-20 10:27:10,686 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 10:27:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:11,972 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-20 10:27:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:27:11,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-20 10:27:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:11,974 INFO L225 Difference]: With dead ends: 304 [2019-01-20 10:27:11,974 INFO L226 Difference]: Without dead ends: 226 [2019-01-20 10:27:11,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-20 10:27:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-20 10:27:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-20 10:27:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-20 10:27:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-20 10:27:11,999 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-20 10:27:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:12,000 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-20 10:27:12,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:27:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-20 10:27:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-20 10:27:12,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:12,001 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-20 10:27:12,001 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-20 10:27:12,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:12,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:12,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:12,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:12,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:12,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:12,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:12,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:12,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:12,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:12,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:13,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:14,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:14,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-20 10:27:14,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:14,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:27:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:27:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 10:27:14,224 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-20 10:27:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:15,769 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-20 10:27:15,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 10:27:15,770 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-20 10:27:15,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:15,771 INFO L225 Difference]: With dead ends: 315 [2019-01-20 10:27:15,772 INFO L226 Difference]: Without dead ends: 152 [2019-01-20 10:27:15,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:27:15,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-20 10:27:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-20 10:27:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-20 10:27:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-20 10:27:15,800 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-20 10:27:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:15,800 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-20 10:27:15,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:27:15,800 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-20 10:27:15,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-20 10:27:15,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:15,801 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-20 10:27:15,801 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-20 10:27:15,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:15,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:15,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:17,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:17,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:17,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:17,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:17,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:17,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:17,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:17,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:17,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 10:27:17,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:17,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:20,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:23,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:23,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-20 10:27:23,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:23,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:27:23,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:27:23,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 10:27:23,224 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-20 10:27:35,510 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-20 10:27:35,843 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-20 10:27:36,237 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-20 10:27:36,540 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:27:36,804 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:27:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:39,341 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-20 10:27:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-20 10:27:39,342 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-20 10:27:39,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:39,344 INFO L225 Difference]: With dead ends: 401 [2019-01-20 10:27:39,344 INFO L226 Difference]: Without dead ends: 234 [2019-01-20 10:27:39,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-20 10:27:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-20 10:27:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-20 10:27:39,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-20 10:27:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-20 10:27:39,376 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-20 10:27:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:39,376 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-20 10:27:39,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:27:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-20 10:27:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-20 10:27:39,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:39,378 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-20 10:27:39,378 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:39,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-20 10:27:39,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:39,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:39,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:39,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:41,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:41,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:41,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:41,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:41,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:41,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:41,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:41,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:42,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:42,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:42,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:43,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:43,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-20 10:27:43,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:43,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:27:43,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:27:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:27:43,520 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-20 10:27:49,550 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-20 10:27:49,888 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-20 10:27:50,207 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-20 10:27:50,415 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:27:50,613 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:27:50,808 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:27:51,556 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-20 10:27:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:52,818 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-20 10:27:52,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:27:52,819 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-20 10:27:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:52,820 INFO L225 Difference]: With dead ends: 334 [2019-01-20 10:27:52,820 INFO L226 Difference]: Without dead ends: 248 [2019-01-20 10:27:52,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-20 10:27:52,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-20 10:27:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-20 10:27:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-20 10:27:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-20 10:27:52,850 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-20 10:27:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:52,850 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-20 10:27:52,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:27:52,850 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-20 10:27:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-20 10:27:52,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:52,852 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-20 10:27:52,852 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-20 10:27:52,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:52,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:52,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:53,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:53,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:53,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:53,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:53,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:53,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:53,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:53,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:53,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:55,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:55,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:55,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-20 10:27:55,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:55,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:27:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:27:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 10:27:55,850 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-20 10:27:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:57,811 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-20 10:27:57,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 10:27:57,813 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-20 10:27:57,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:57,814 INFO L225 Difference]: With dead ends: 345 [2019-01-20 10:27:57,814 INFO L226 Difference]: Without dead ends: 166 [2019-01-20 10:27:57,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:27:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-20 10:27:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-20 10:27:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-20 10:27:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-20 10:27:57,862 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-20 10:27:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:57,862 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-20 10:27:57,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:27:57,862 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-20 10:27:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-20 10:27:57,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:57,863 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-20 10:27:57,864 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:57,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:57,864 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-20 10:27:57,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:57,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:57,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:57,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:27:59,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:59,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:59,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:59,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:59,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:59,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:27:59,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:59,711 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:59,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 10:27:59,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:59,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:01,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:01,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:01,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-20 10:28:01,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:01,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:28:01,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:28:01,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:28:01,331 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-20 10:28:08,790 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-20 10:28:09,142 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-20 10:28:09,477 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-20 10:28:09,696 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:28:09,913 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:28:10,121 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:28:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:12,439 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-20 10:28:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:28:12,439 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-20 10:28:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:12,441 INFO L225 Difference]: With dead ends: 349 [2019-01-20 10:28:12,441 INFO L226 Difference]: Without dead ends: 259 [2019-01-20 10:28:12,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 10:28:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-20 10:28:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-20 10:28:12,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-20 10:28:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-20 10:28:12,474 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-20 10:28:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:12,474 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-20 10:28:12,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:28:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-20 10:28:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-20 10:28:12,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:12,475 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-20 10:28:12,476 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:12,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:12,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-20 10:28:12,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:12,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:12,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:12,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:13,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:13,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:13,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:13,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:13,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:13,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:13,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:13,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:13,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:13,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:14,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:15,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:15,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-20 10:28:15,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:15,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:28:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:28:15,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:28:15,406 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-20 10:28:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:17,482 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-20 10:28:17,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:28:17,482 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-20 10:28:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:17,484 INFO L225 Difference]: With dead ends: 360 [2019-01-20 10:28:17,484 INFO L226 Difference]: Without dead ends: 173 [2019-01-20 10:28:17,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:28:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-20 10:28:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-20 10:28:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-20 10:28:17,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-20 10:28:17,519 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-20 10:28:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:17,519 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-20 10:28:17,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:28:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-20 10:28:17,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-20 10:28:17,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:17,521 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-20 10:28:17,521 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:17,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:17,521 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-20 10:28:17,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:17,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:17,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:19,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:19,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:19,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:19,301 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:19,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:19,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:19,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:19,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:19,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:19,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:21,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:21,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:21,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-20 10:28:21,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:21,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:28:21,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:28:21,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 10:28:21,354 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-20 10:28:29,332 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-20 10:28:29,698 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-20 10:28:30,059 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-20 10:28:30,297 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:28:30,542 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:28:30,757 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:28:30,970 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:28:31,172 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:28:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:33,293 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-20 10:28:33,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:28:33,293 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-20 10:28:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:33,295 INFO L225 Difference]: With dead ends: 364 [2019-01-20 10:28:33,295 INFO L226 Difference]: Without dead ends: 270 [2019-01-20 10:28:33,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-20 10:28:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-20 10:28:33,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-20 10:28:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-20 10:28:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-20 10:28:33,341 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-20 10:28:33,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:33,341 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-20 10:28:33,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:28:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-20 10:28:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-20 10:28:33,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:33,342 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-20 10:28:33,342 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:33,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:33,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-20 10:28:33,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:33,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:33,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:33,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:33,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:35,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:35,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:35,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:35,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:35,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:35,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:35,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:35,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 10:28:35,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:35,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:36,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:37,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:37,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:37,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-20 10:28:37,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:37,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:28:37,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:28:37,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 10:28:37,456 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-20 10:28:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:39,497 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-20 10:28:39,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:28:39,498 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-20 10:28:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:39,499 INFO L225 Difference]: With dead ends: 375 [2019-01-20 10:28:39,499 INFO L226 Difference]: Without dead ends: 180 [2019-01-20 10:28:39,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:28:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-20 10:28:39,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-20 10:28:39,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-20 10:28:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-20 10:28:39,535 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-20 10:28:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:39,535 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-20 10:28:39,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:28:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-20 10:28:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-20 10:28:39,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:39,536 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-20 10:28:39,536 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:39,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:39,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-20 10:28:39,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:39,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:39,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:39,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:39,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:41,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:41,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:41,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:41,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:41,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:41,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:41,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:41,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:41,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:41,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:41,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:43,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:43,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-20 10:28:43,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:43,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:28:43,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:28:43,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:28:43,455 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-20 10:28:50,166 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-20 10:28:50,558 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-20 10:28:50,929 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-20 10:28:51,183 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:28:51,425 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:28:51,657 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:28:51,883 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:28:52,099 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:28:52,310 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:28:52,938 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 10:28:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:54,521 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-20 10:28:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:28:54,521 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-20 10:28:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:54,523 INFO L225 Difference]: With dead ends: 379 [2019-01-20 10:28:54,523 INFO L226 Difference]: Without dead ends: 281 [2019-01-20 10:28:54,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:28:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-20 10:28:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-20 10:28:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-20 10:28:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-20 10:28:54,560 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-20 10:28:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:54,560 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-20 10:28:54,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:28:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-20 10:28:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-20 10:28:54,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:54,561 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-20 10:28:54,562 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-20 10:28:54,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:54,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:54,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:54,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:56,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:56,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:56,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:56,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:56,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:56,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:28:56,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:56,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:56,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:57,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:28:58,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:58,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-20 10:28:58,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:58,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:28:58,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:28:58,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:28:58,709 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-20 10:29:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:00,784 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-20 10:29:00,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:29:00,784 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-20 10:29:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:00,786 INFO L225 Difference]: With dead ends: 390 [2019-01-20 10:29:00,786 INFO L226 Difference]: Without dead ends: 187 [2019-01-20 10:29:00,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:29:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-20 10:29:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-20 10:29:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 10:29:00,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-20 10:29:00,839 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-20 10:29:00,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:00,839 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-20 10:29:00,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:29:00,839 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-20 10:29:00,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-20 10:29:00,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:00,841 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-20 10:29:00,841 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:00,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:00,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-20 10:29:00,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:00,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:00,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:00,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:02,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:02,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:02,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:02,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:02,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:02,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:02,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:02,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:02,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-20 10:29:02,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:02,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:07,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:11,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:11,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-20 10:29:11,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:11,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-20 10:29:11,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-20 10:29:11,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-20 10:29:11,844 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-20 10:29:30,198 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-20 10:29:30,657 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-20 10:29:31,141 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-20 10:29:31,542 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:29:31,935 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:29:32,315 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:29:32,678 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:29:33,020 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:29:33,344 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:29:34,024 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:29:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:36,749 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-20 10:29:36,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-20 10:29:36,749 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-20 10:29:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:36,751 INFO L225 Difference]: With dead ends: 496 [2019-01-20 10:29:36,751 INFO L226 Difference]: Without dead ends: 289 [2019-01-20 10:29:36,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.8s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-20 10:29:36,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-20 10:29:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-20 10:29:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-20 10:29:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-20 10:29:36,799 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-20 10:29:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:36,799 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-20 10:29:36,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-20 10:29:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-20 10:29:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-20 10:29:36,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:36,800 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-20 10:29:36,801 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:36,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:36,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-20 10:29:36,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:36,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:36,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:36,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:36,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:39,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:39,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:39,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:39,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:39,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:39,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:39,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:39,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:39,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:39,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:41,024 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-20 10:29:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:43,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:43,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:43,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-20 10:29:43,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:43,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:29:43,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:29:43,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:29:43,882 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-20 10:29:52,747 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-20 10:29:53,156 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-20 10:29:53,561 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-20 10:29:53,844 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:29:54,118 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:29:54,448 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:29:54,713 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:29:54,982 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:29:55,218 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:29:55,447 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:29:55,663 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:29:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:57,895 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-20 10:29:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-20 10:29:57,895 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-20 10:29:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:57,897 INFO L225 Difference]: With dead ends: 409 [2019-01-20 10:29:57,897 INFO L226 Difference]: Without dead ends: 303 [2019-01-20 10:29:57,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:29:57,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-20 10:29:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-20 10:29:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-20 10:29:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-20 10:29:57,940 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-20 10:29:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:57,940 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-20 10:29:57,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:29:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-20 10:29:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-20 10:29:57,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:57,941 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-20 10:29:57,941 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:57,942 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-20 10:29:57,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:57,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:57,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:57,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:57,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:29:59,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:59,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:59,080 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:59,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:59,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:59,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:29:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:59,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:59,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:00,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:01,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:01,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-20 10:30:01,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:01,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:30:01,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:30:01,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:30:01,892 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-20 10:30:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:04,333 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-20 10:30:04,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:30:04,334 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-20 10:30:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:04,335 INFO L225 Difference]: With dead ends: 420 [2019-01-20 10:30:04,336 INFO L226 Difference]: Without dead ends: 201 [2019-01-20 10:30:04,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 10:30:04,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-20 10:30:04,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-20 10:30:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-20 10:30:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-20 10:30:04,378 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-20 10:30:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:04,378 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-20 10:30:04,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:30:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-20 10:30:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-20 10:30:04,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:04,379 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-20 10:30:04,380 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:04,380 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-20 10:30:04,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:04,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:04,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:04,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:06,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:06,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:06,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:06,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:06,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:06,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:06,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:06,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:06,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-20 10:30:06,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:06,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:08,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:08,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:08,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-20 10:30:08,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:08,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:30:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:30:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 10:30:08,861 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-20 10:30:17,722 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-20 10:30:18,145 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-20 10:30:18,570 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-20 10:30:18,863 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:30:19,154 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:30:19,433 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:30:19,716 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:30:20,012 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:30:20,260 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:30:20,497 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:30:20,733 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:30:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:23,216 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-20 10:30:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-20 10:30:23,217 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-20 10:30:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:23,219 INFO L225 Difference]: With dead ends: 424 [2019-01-20 10:30:23,219 INFO L226 Difference]: Without dead ends: 314 [2019-01-20 10:30:23,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-20 10:30:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-20 10:30:23,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-20 10:30:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-20 10:30:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-20 10:30:23,281 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-20 10:30:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:23,282 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-20 10:30:23,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:30:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-20 10:30:23,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-20 10:30:23,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:23,283 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-20 10:30:23,284 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:23,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:23,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-20 10:30:23,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:23,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:23,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:23,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:23,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:24,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:24,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:24,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:24,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:24,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:24,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:24,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:24,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:24,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:24,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:24,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:26,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:27,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:27,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-20 10:30:27,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:27,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:30:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:30:27,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 10:30:27,388 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-20 10:30:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:29,896 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-20 10:30:29,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:30:29,896 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-20 10:30:29,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:29,897 INFO L225 Difference]: With dead ends: 435 [2019-01-20 10:30:29,897 INFO L226 Difference]: Without dead ends: 208 [2019-01-20 10:30:29,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:30:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-20 10:30:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-20 10:30:29,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-20 10:30:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-20 10:30:29,950 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-20 10:30:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:29,951 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-20 10:30:29,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:30:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-20 10:30:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-20 10:30:29,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:29,952 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-20 10:30:29,952 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-20 10:30:29,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:29,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:29,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:29,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:32,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:32,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:32,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:32,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:32,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:32,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:32,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:32,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:30:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:32,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:34,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:34,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:34,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-20 10:30:34,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:34,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:30:34,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:30:34,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:30:34,776 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-20 10:30:44,306 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-20 10:30:44,764 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-20 10:30:45,206 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-20 10:30:45,540 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:30:45,880 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:30:46,184 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:30:46,459 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:30:46,731 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:30:46,991 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:30:47,251 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:30:47,491 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:30:47,721 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:30:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:50,220 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-20 10:30:50,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-20 10:30:50,220 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-20 10:30:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:50,222 INFO L225 Difference]: With dead ends: 439 [2019-01-20 10:30:50,222 INFO L226 Difference]: Without dead ends: 325 [2019-01-20 10:30:50,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:30:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-20 10:30:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-20 10:30:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-20 10:30:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-20 10:30:50,270 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-20 10:30:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:50,270 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-20 10:30:50,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:30:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-20 10:30:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-20 10:30:50,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:50,272 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-20 10:30:50,272 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-20 10:30:50,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:50,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:50,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:52,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:52,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:52,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:52,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:52,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:30:52,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:52,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:52,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-20 10:30:52,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:52,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:53,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:30:55,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:55,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-20 10:30:55,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:55,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:30:55,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:30:55,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:30:55,201 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-20 10:30:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:58,094 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-20 10:30:58,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:30:58,094 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-20 10:30:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:58,095 INFO L225 Difference]: With dead ends: 450 [2019-01-20 10:30:58,096 INFO L226 Difference]: Without dead ends: 215 [2019-01-20 10:30:58,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:30:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-20 10:30:58,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-20 10:30:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-20 10:30:58,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-20 10:30:58,166 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-20 10:30:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:58,167 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-20 10:30:58,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:30:58,167 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-20 10:30:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-20 10:30:58,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:58,168 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-20 10:30:58,169 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-20 10:30:58,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:58,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:58,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:58,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:00,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:00,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:00,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:00,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:00,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:00,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:00,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:00,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:00,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:00,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:00,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:03,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:03,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:03,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-20 10:31:03,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:31:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:31:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:31:03,647 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-20 10:31:14,346 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-20 10:31:14,817 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-20 10:31:15,308 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-20 10:31:15,633 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:31:15,946 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:31:16,294 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:31:16,638 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:31:16,934 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:31:17,219 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:31:17,499 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:31:17,771 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:31:18,031 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:31:18,293 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:31:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:20,936 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-20 10:31:20,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-20 10:31:20,936 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-20 10:31:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:20,938 INFO L225 Difference]: With dead ends: 454 [2019-01-20 10:31:20,938 INFO L226 Difference]: Without dead ends: 336 [2019-01-20 10:31:20,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-20 10:31:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-20 10:31:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-20 10:31:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-20 10:31:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-20 10:31:21,018 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-20 10:31:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:21,018 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-20 10:31:21,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:31:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-20 10:31:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-20 10:31:21,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:21,019 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-20 10:31:21,019 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-20 10:31:21,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:21,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:21,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:21,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:22,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:22,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:22,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:22,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:22,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:22,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:22,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:22,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:22,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:24,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:25,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:25,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-20 10:31:25,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:25,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:31:25,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:31:25,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 10:31:25,430 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-20 10:31:28,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:28,420 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-20 10:31:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:31:28,420 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-20 10:31:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:28,421 INFO L225 Difference]: With dead ends: 465 [2019-01-20 10:31:28,421 INFO L226 Difference]: Without dead ends: 222 [2019-01-20 10:31:28,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:31:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-20 10:31:28,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-20 10:31:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-20 10:31:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-20 10:31:28,467 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-20 10:31:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:28,467 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-20 10:31:28,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:31:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-20 10:31:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-20 10:31:28,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:28,468 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-20 10:31:28,468 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:28,468 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-20 10:31:28,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:28,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:30,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:30,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:30,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:30,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:30,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:30,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:31:30,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:31:30,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:30,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-20 10:31:30,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:30,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:37,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:31:43,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:43,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-20 10:31:43,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:43,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-20 10:31:43,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-20 10:31:43,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:31:43,137 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-20 10:32:08,623 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-20 10:32:09,212 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-20 10:32:09,824 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-20 10:32:10,359 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:32:10,911 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:32:11,413 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:32:11,888 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:32:12,356 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:32:12,853 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:32:13,288 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:32:13,709 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:32:14,106 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:32:14,496 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:32:14,865 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:32:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:18,784 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-20 10:32:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-20 10:32:18,785 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-20 10:32:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:18,787 INFO L225 Difference]: With dead ends: 591 [2019-01-20 10:32:18,787 INFO L226 Difference]: Without dead ends: 344 [2019-01-20 10:32:18,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-20 10:32:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-20 10:32:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-20 10:32:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-20 10:32:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-20 10:32:18,843 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-20 10:32:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:18,843 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-20 10:32:18,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-20 10:32:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-20 10:32:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-20 10:32:18,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:18,845 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-20 10:32:18,845 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-20 10:32:18,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:18,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:18,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:18,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:21,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:21,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:21,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:21,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:21,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:21,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:21,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:32:21,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:32:21,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:32:21,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:21,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:24,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:24,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:24,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-20 10:32:24,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:24,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:32:24,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:32:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 10:32:24,415 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-20 10:32:37,651 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-20 10:32:38,260 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-20 10:32:38,790 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-20 10:32:39,138 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:32:39,477 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:32:39,818 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:32:40,138 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:32:40,458 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:32:40,774 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:32:41,089 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:32:41,391 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:32:41,678 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:32:41,958 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:32:42,227 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:32:42,488 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:32:42,740 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:32:43,210 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-20 10:32:43,481 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-20 10:32:43,744 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-20 10:32:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:45,402 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-20 10:32:45,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-20 10:32:45,403 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-20 10:32:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:45,405 INFO L225 Difference]: With dead ends: 484 [2019-01-20 10:32:45,405 INFO L226 Difference]: Without dead ends: 358 [2019-01-20 10:32:45,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-20 10:32:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-20 10:32:45,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-20 10:32:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-20 10:32:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-20 10:32:45,460 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-20 10:32:45,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:45,460 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-20 10:32:45,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:32:45,461 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-20 10:32:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-20 10:32:45,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:45,462 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-20 10:32:45,462 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-20 10:32:45,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:45,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:45,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:45,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:47,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:47,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:47,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:47,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:47,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:47,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:47,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:47,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:32:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:47,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:49,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:50,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:50,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-20 10:32:50,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:50,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:32:50,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:32:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 10:32:50,774 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-20 10:32:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:53,230 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-20 10:32:53,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:32:53,230 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-20 10:32:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:53,232 INFO L225 Difference]: With dead ends: 495 [2019-01-20 10:32:53,232 INFO L226 Difference]: Without dead ends: 236 [2019-01-20 10:32:53,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:32:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-20 10:32:53,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-20 10:32:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-20 10:32:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-20 10:32:53,291 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-20 10:32:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:53,291 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-20 10:32:53,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:32:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-20 10:32:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-20 10:32:53,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:53,293 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-20 10:32:53,293 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-20 10:32:53,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:53,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:53,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:53,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:55,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:32:55,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:55,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:55,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:55,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:55,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:55,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:32:55,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:55,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:32:55,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-20 10:32:55,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:55,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:03,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:09,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:09,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-20 10:33:09,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:09,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-20 10:33:09,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-20 10:33:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:33:09,877 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-20 10:33:36,334 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-20 10:33:36,951 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-20 10:33:37,596 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-20 10:33:38,179 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:33:38,757 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:33:39,313 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:33:39,902 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:33:40,429 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:33:40,940 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:33:41,429 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:33:41,909 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:33:42,372 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:33:42,814 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:33:43,238 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:33:43,717 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:33:44,107 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:33:44,875 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:33:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:48,113 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-20 10:33:48,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-20 10:33:48,113 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-20 10:33:48,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:48,115 INFO L225 Difference]: With dead ends: 629 [2019-01-20 10:33:48,116 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:33:48,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 45.6s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-20 10:33:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:33:48,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-20 10:33:48,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-20 10:33:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-20 10:33:48,175 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-20 10:33:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:48,175 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-20 10:33:48,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-20 10:33:48,175 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-20 10:33:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-20 10:33:48,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:48,176 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-20 10:33:48,177 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:48,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-20 10:33:48,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:48,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:48,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:48,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:48,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:51,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:51,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:51,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:51,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:51,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:51,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:33:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:51,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:51,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:51,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:51,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:54,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:33:54,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:54,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-20 10:33:54,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:54,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:33:54,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:33:54,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 10:33:54,353 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-20 10:34:07,023 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-20 10:34:07,591 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-20 10:34:08,138 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-20 10:34:08,531 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:34:08,910 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:34:09,281 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:34:09,652 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:34:10,005 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:34:10,389 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:34:10,739 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:34:11,063 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:34:11,379 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:34:11,694 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:34:11,988 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:34:12,276 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:34:12,603 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:34:12,874 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:34:13,134 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:34:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:15,991 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-20 10:34:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-20 10:34:15,991 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-20 10:34:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:15,993 INFO L225 Difference]: With dead ends: 514 [2019-01-20 10:34:15,993 INFO L226 Difference]: Without dead ends: 380 [2019-01-20 10:34:15,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:34:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-20 10:34:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-20 10:34:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-20 10:34:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-20 10:34:16,057 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-20 10:34:16,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:16,057 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-20 10:34:16,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:34:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-20 10:34:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-20 10:34:16,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:16,058 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-20 10:34:16,058 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-20 10:34:16,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:16,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:16,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:16,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:16,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:17,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:17,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:17,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:17,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:17,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:17,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:17,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:17,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:17,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:19,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:21,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:21,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-20 10:34:21,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:21,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:34:21,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:34:21,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 10:34:21,409 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-20 10:34:24,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:24,098 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-20 10:34:24,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:34:24,099 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-20 10:34:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:24,101 INFO L225 Difference]: With dead ends: 525 [2019-01-20 10:34:24,101 INFO L226 Difference]: Without dead ends: 250 [2019-01-20 10:34:24,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:34:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-20 10:34:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-20 10:34:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-20 10:34:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-20 10:34:24,186 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-20 10:34:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:24,186 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-20 10:34:24,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:34:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-20 10:34:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-20 10:34:24,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:24,188 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-20 10:34:24,189 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:24,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:24,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-20 10:34:24,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:24,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:24,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:24,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:27,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:27,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:27,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:27,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:27,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:27,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:34:27,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:34:27,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:34:27,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-20 10:34:27,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:27,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:35,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:34:42,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:42,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-20 10:34:42,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:42,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-20 10:34:42,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-20 10:34:42,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:34:42,758 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-20 10:35:11,886 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-20 10:35:12,606 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-20 10:35:13,305 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-20 10:35:13,939 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:35:14,557 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:35:15,171 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:35:15,759 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:35:16,330 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:35:16,904 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:35:17,469 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:35:18,003 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:35:18,517 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:35:19,026 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:35:19,554 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:35:20,032 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:35:20,488 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:35:20,901 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:35:21,307 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:35:21,695 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:35:22,120 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-20 10:35:25,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:25,536 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-20 10:35:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-20 10:35:25,536 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-20 10:35:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:25,538 INFO L225 Difference]: With dead ends: 667 [2019-01-20 10:35:25,538 INFO L226 Difference]: Without dead ends: 388 [2019-01-20 10:35:25,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-20 10:35:25,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-20 10:35:25,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-20 10:35:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-20 10:35:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-20 10:35:25,607 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-20 10:35:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:25,607 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-20 10:35:25,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-20 10:35:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-20 10:35:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-20 10:35:25,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:25,608 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-20 10:35:25,608 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-20 10:35:25,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:25,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:25,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:25,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:25,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:28,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:28,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:28,954 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:28,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:28,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:28,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:28,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:35:28,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:35:29,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:35:29,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:29,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:32,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:32,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:32,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-20 10:35:32,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:32,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:35:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:35:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 10:35:32,652 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-20 10:35:47,191 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-20 10:35:47,879 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-20 10:35:48,488 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-20 10:35:48,914 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-20 10:35:49,343 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:35:49,760 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:35:50,170 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:35:50,562 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:35:50,951 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:35:51,317 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:35:51,683 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:35:52,039 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:35:52,375 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:35:52,740 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:35:53,086 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:35:53,405 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:35:53,706 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:35:53,998 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:35:54,276 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:35:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:57,444 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-20 10:35:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-20 10:35:57,445 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-20 10:35:57,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:57,446 INFO L225 Difference]: With dead ends: 544 [2019-01-20 10:35:57,447 INFO L226 Difference]: Without dead ends: 402 [2019-01-20 10:35:57,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-20 10:35:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-20 10:35:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-20 10:35:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-20 10:35:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-20 10:35:57,514 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-20 10:35:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:57,514 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-20 10:35:57,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:35:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-20 10:35:57,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-20 10:35:57,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:57,516 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-20 10:35:57,516 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:57,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:57,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-20 10:35:57,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:57,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:57,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:57,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:57,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:35:59,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:59,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:59,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:59,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:59,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:59,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:35:59,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:59,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:35:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:59,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:01,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:03,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:03,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:03,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-20 10:36:03,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:03,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:36:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:36:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 10:36:03,717 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-20 10:36:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:06,753 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-20 10:36:06,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:36:06,753 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-20 10:36:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:06,755 INFO L225 Difference]: With dead ends: 555 [2019-01-20 10:36:06,755 INFO L226 Difference]: Without dead ends: 264 [2019-01-20 10:36:06,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:36:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-20 10:36:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-20 10:36:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-20 10:36:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-20 10:36:06,823 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-20 10:36:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:06,824 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-20 10:36:06,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:36:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-20 10:36:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-20 10:36:06,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:06,825 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-20 10:36:06,825 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:06,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:06,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-20 10:36:06,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:06,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:36:06,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:06,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:10,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:10,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:10,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:10,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:10,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:10,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:36:10,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:36:10,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:36:10,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-20 10:36:10,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:10,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:19,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:36:27,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:27,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-20 10:36:27,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:27,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-20 10:36:27,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-20 10:36:27,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:36:27,327 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-20 10:36:59,816 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-20 10:37:00,575 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-20 10:37:01,369 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-20 10:37:02,074 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-20 10:37:02,763 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-20 10:37:03,430 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:37:04,072 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:37:04,722 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:37:05,325 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:37:05,922 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:37:06,498 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:37:07,059 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:37:07,604 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:37:08,195 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:37:08,710 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:37:09,209 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:37:09,727 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:37:10,187 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:37:10,634 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:37:11,070 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:37:11,471 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-20 10:37:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:37:15,593 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-20 10:37:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-20 10:37:15,594 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-20 10:37:15,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:37:15,595 INFO L225 Difference]: With dead ends: 705 [2019-01-20 10:37:15,595 INFO L226 Difference]: Without dead ends: 410 [2019-01-20 10:37:15,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 57.1s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-20 10:37:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-20 10:37:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-20 10:37:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-20 10:37:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-20 10:37:15,678 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-20 10:37:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:37:15,678 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-20 10:37:15,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-20 10:37:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-20 10:37:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-20 10:37:15,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:37:15,679 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-20 10:37:15,680 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:37:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:37:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-20 10:37:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:37:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:15,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:37:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:37:15,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:37:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:37:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:18,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:18,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:37:18,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:37:18,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:37:18,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:37:18,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:37:18,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:37:18,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:37:18,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:37:18,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:37:18,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:37:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:22,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:37:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:37:23,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:37:23,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-20 10:37:23,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:37:23,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-20 10:37:23,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-20 10:37:23,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 10:37:23,117 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-20 10:37:40,228 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-20 10:37:41,102 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-20 10:37:41,741 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-20 10:37:42,214 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-20 10:37:42,675 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-20 10:37:43,117 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-20 10:37:43,551 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-20 10:37:43,980 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-20 10:37:44,392 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-20 10:37:44,800 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-20 10:37:45,193 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-20 10:37:45,659 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-20 10:37:46,035 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-20 10:37:46,407 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-20 10:37:46,768 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-20 10:37:47,113 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-20 10:37:47,463 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-20 10:37:47,796 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-20 10:37:48,119 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-20 10:37:48,421 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-20 10:37:48,718 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-20 10:37:49,003 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94